On the complexity of computing treelength (Q972342): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2009.10.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980831620 / 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: Treewidth and Minimum Fill-in: Grouping the Minimal Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact Routing Schemes for Bounded Tree-Length Graphs and for k-Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanners for bounded tree-length graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-decompositions with bags of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for minimum-weight vertex separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Treewidth and Minimum Fill-In / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth Computation and Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal triangulations of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On treewidth and minimum fill-in of asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank

Latest revision as of 21:17, 2 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of computing treelength
scientific article

    Statements

    On the complexity of computing treelength (English)
    0 references
    0 references
    25 May 2010
    0 references
    graph tree-length
    0 references
    NP-completeness
    0 references
    approximation
    0 references
    inapproximability
    0 references
    exact exponential algorithm
    0 references
    chordal sandwich problem
    0 references

    Identifiers

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