Induced disjoint paths in circular-arc graphs in linear time (Q2629233): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Detecting fixed patterns in chordal graphs in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to: On the complexity of testing for odd holes and induced odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3034816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-in-a-path problem for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced subgraphs via triangulations and CMSO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced disjoint paths in AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Disjoint Paths in Claw-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Disjoint Paths in Circular-Arc Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex disjoint paths on clique-width bounded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Disjoint Paths in Split Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simpler linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the induced disjoint paths problem in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank

Latest revision as of 07:10, 12 July 2024

scientific article
Language Label Description Also known as
English
Induced disjoint paths in circular-arc graphs in linear time
scientific article

    Statements

    Induced disjoint paths in circular-arc graphs in linear time (English)
    0 references
    0 references
    0 references
    0 references
    5 July 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    induced disjoint paths
    0 references
    circular-arc graphs
    0 references
    linear-time algorithm
    0 references
    0 references
    0 references