A faster algorithm to recognize even-hole-free graphs (Q2347846): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3103742520 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.0358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimplicial vertices in even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of testing for odd holes and induced odd paths / 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: Q5743476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting 2-joins faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting even holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{4}\)-free graphs with no odd holes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The three-in-a-tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4238043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Hole Recognition in Graphs of Bounded Clique Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of odd-hole-free graphs by double star cutsets and 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions for perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulated neighborhoods in even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of even-hole-free graphs with star cutsets and 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of clique-coloring odd-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-completeness column / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding an induced cycle in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a smallest odd hole in a claw-free graph using global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Perfectly Contractile Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting holes and antiholes in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4161356 / 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: Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the treewidth of planar even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Berge graphs and detecting balanced skew partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization with 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: K4-free graphs with no odd hole: Even pairs and the circular chromatic number / rank
 
Normal rank

Latest revision as of 05:28, 10 July 2024

scientific article
Language Label Description Also known as
English
A faster algorithm to recognize even-hole-free graphs
scientific article

    Statements

    A faster algorithm to recognize even-hole-free graphs (English)
    0 references
    0 references
    0 references
    10 June 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    even hole
    0 references
    decomposition-based detection algorithm
    0 references
    extended clique tree
    0 references
    2-join
    0 references
    star-cutset
    0 references
    diamond
    0 references
    beetle
    0 references
    tracker
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references