Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for decomposing graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs with girth at least five under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic approach to the satisfactory graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for vertex-partitioning problems on graphs with fixed clique-width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of triangle-free graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems / rank
 
Normal rank

Latest revision as of 12:12, 24 June 2024

scientific article
Language Label Description Also known as
English
Degree-constrained decompositions of graphs: Bounded treewidth and planarity
scientific article

    Statements

    Degree-constrained decompositions of graphs: Bounded treewidth and planarity (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2006
    0 references
    Graph decomposition
    0 references
    Treewidth
    0 references
    Planar graph
    0 references
    Polynomial algorithm
    0 references
    PTAS
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references