Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783): 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.1007/978-3-642-25870-1_25 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W110470963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple linear time recognition of unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth on AT-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column: an ongoing guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Bandwidth for Asteroidal Triple-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the minimum bandwidth of interval graphs / 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: An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation intractability of the path-distance-width problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism for graphs of bounded distance width / rank
 
Normal rank

Latest revision as of 18:40, 4 July 2024

scientific article
Language Label Description Also known as
English
Approximability of the Path-Distance-Width for AT-free Graphs
scientific article

    Statements

    Approximability of the Path-Distance-Width for AT-free Graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    \(k\)-cocomparability graphs
    0 references
    AT-free graphs
    0 references
    interval graphs
    0 references
    0 references