A note on perfect partial elimination

DOI10.1016/j.disc.2013.04.001zbMath1408.05131OpenAlexW2744500600MaRDI QIDQ389218

Georg Still, Matthijs Bomhoff, Walter Kern

Publication date: 20 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.001

zbMATH Keywords

bipartite graphGaussian eliminationperfect elimination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (05C99)

Cites Work

• Unnamed Item
• Recognizing quasi-triangulated graphs.
• Recognition of perfect elimination bipartite graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• The complexity of theorem-proving procedures

This page was built for publication: A note on perfect partial elimination