An algorithm for finding homogeneous pairs
From MaRDI portal
Publication:674438
DOI10.1016/0166-218X(95)00090-EzbMATH Open0874.05052OpenAlexW1979621874MaRDI QIDQ674438FDOQ674438
Authors: Hazel Everett, Sulamita Klein, Bruce Reed 
Publication date: 9 November 1997
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
- Algorithms for some \(H\)-join decompositions
- Algorithms for the homogeneous set sandwich problem
- An efficient algorithm for solving the homogeneous set sandwich problem
- The pair completion algorithm for the homogeneous set sandwich problem
- An efficient algorithm for finding a two-pair, and its applications
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Normal hypergraphs and the perfect graph conjecture
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(P_ 4\)-trees and substitution decomposition
- Comparability graphs and a new matroid
- Incremental modular decomposition
- Bull-free Berge graphs are perfect
Cited In (10)
- Computing pairings using \(x\)-coordinates only
- Coloring perfect graphs with no balanced skew-partitions
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
- An efficient algorithm for finding a two-pair, and its applications
- Counting List Matrix Partitions of Graphs
- The sandwich problem for decompositions and almost monotone properties
- Computing \(H\)-joins with application to 2-modular decomposition
- Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
- Graph parameters measuring neighbourhoods in graphs-bounds and applications
- Algorithms for some \(H\)-join decompositions
This page was built for publication: An algorithm for finding homogeneous pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674438)
