A note on perfect partial elimination

DOI10.1016/J.DISC.2013.04.001MaRDI QIDQ389218zbMATH OpenOpenAlexFDO

Authors Matthijs Bomhoff, Walter Kern, Georg Still

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

Gaussian eliminationbipartite graphperfect elimination

Mathematics Subject Classification ID

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

Recommendations

• Some aspects of the semi-perfect elimination
• On the semi-perfect elimination
• scientific article; zbMATH DE number 4027602
• A note on passepartout problems
• A Generalization of Lazard's Elimination Theorem
• A remark on perfect Gaussian elimination of symmetric matrices
• scientific article; zbMATH DE number 140121
• A NOTE ON PARTIAL SIGN-SOLVABILITY
• A note on perfect graphs
• A note on the determinant and permanent problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Recognition of perfect elimination bipartite graphs
• Recognizing quasi-triangulated graphs.
• The complexity of theorem-proving procedures

Cited in

(4)

• Some aspects of the semi-perfect elimination
• Recognizing sparse perfect elimination bipartite graphs
• A note on splitting the bump in an elimination factorization
• scientific article; zbMATH DE number 1639655 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389218)