Detecting 2-joins faster (Q2376790): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Pierre Charbit / rank
Normal rank
 
Property / author
 
Property / author: Michel A. Habib / rank
Normal rank
 
Property / author
 
Property / author: Pierre Charbit / rank
 
Normal rank
Property / author
 
Property / author: Michel A. Habib / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59902211 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061452048 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1107.3977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced \(0,\pm 1\) matrices. I: Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced \(0,\pm 1\) matrices. II: Recognition algorithm / 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: Square-free perfect graphs. / 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: A Combinatorial Decomposition Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Split Decomposition Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n2) Algorithm for Undirected Split Decomposition / 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

Latest revision as of 13:22, 6 July 2024

scientific article
Language Label Description Also known as
English
Detecting 2-joins faster
scientific article

    Statements

    Detecting 2-joins faster (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    2-join
    0 references
    edge cutset
    0 references
    detection
    0 references
    closed classes of graphs
    0 references
    induced subgraphs
    0 references
    balanced bipartite graphs
    0 references
    even-hole-free graphs
    0 references
    perfect graphs
    0 references
    claw free graphs
    0 references

    Identifiers