• Title of article

    The algorithmic theory of treewidth

  • Author/Authors

    Bodlaender، نويسنده , , Hans L.، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2000
  • Pages
    4
  • From page
    27
  • To page
    30
  • Abstract
    Treewidth is a graph measure with several applications. In this abstract, it is discussed that many otherwise intractable problems become polynomial or linear time solvable when restricted to graphs of bounded treewidth, and some other algorithmic results that use treewidth (e.g., applied to planar graphs) are discussed.
  • Keywords
    Treewidth , partial k-tree , graph algorithms
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Serial Year
    2000
  • Journal title
    Electronic Notes in Discrete Mathematics
  • Record number

    1452817

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=1452817