Tree-decompositions with bags of small diameter (Q2370441): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.12.060 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126464568 / rank
 
Normal rank
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: Total Domination and Irredundance in Weighted Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / 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: Q4218147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth for graphs with small chordality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3779759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree spanners on chordal graphs: complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distance approximating trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for embedding planar graphs using PQ-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query efficient implementation of graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3154375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design networks with bounded pairwise distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners for bounded tree-length graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437127 / 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: Tree spanners in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4796196 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and algorithmic applications of chordal graph embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4948512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: A trade-off between space and efficiency for routing tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Vertex Elimination on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition by clique separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4505399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding clique cut-sets / rank
 
Normal rank

Latest revision as of 10:35, 26 June 2024

scientific article
Language Label Description Also known as
English
Tree-decompositions with bags of small diameter
scientific article

    Statements

    Tree-decompositions with bags of small diameter (English)
    0 references
    0 references
    0 references
    26 June 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tree-decomposition
    0 references
    tree-width
    0 references
    tree-length
    0 references
    chordality
    0 references
    small separator
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references