A short note on the complexity of computing strong pathbreadth (Q1705708): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2018.01.005 / rank
Normal rank
 
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.ipl.2018.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2791129715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intervalizing \(k\)-colored graphs for DNA physical mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: To Approximate Treewidth, Use Treelength! / 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: An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line-Distortion, Bandwidth and Path-Length of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On compact and efficient routing in certain graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Computing Treebreadth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching in a convex bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Strong Tree-Breadth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computing treelength / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2018.01.005 / rank
 
Normal rank

Latest revision as of 05:02, 11 December 2024

scientific article
Language Label Description Also known as
English
A short note on the complexity of computing strong pathbreadth
scientific article

    Statements

    A short note on the complexity of computing strong pathbreadth (English)
    0 references
    0 references
    16 March 2018
    0 references
    strong pathbreadth
    0 references
    path decomposition
    0 references
    acyclic clustering
    0 references
    graph theory
    0 references
    NP-completeness
    0 references
    computational complexity
    0 references

    Identifiers