Recognizing Sparse Perfect Elimination Bipartite Graphs

DOI10.1007/978-3-642-20712-9_35zbMath1332.68063OpenAlexW1511233786MaRDI QIDQ3007647

Matthijs Bomhoff

Publication date: 17 June 2011

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/recognizing-sparse-perfect-elimination-bipartite-graphs(86ee3910-9d47-4f07-afff-b8c517c2d70e).html

zbMATH Keywords

algorithmsbipartite graphssparse graphsperfect elimination

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Analysis of algorithms and problem complexity (68Q25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Matrix multiplication via arithmetic progressions
• Recognizing quasi-triangulated graphs.
• Recognition of perfect elimination bipartite graphs
• Computing the Minimum Fill-In is NP-Complete
• Algorithmic Aspects of Vertex Elimination on Graphs
• Algorithmic Aspects of Vertex Elimination on Directed Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Toward Characterization of Perfect Elimination Digraphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing Sparse Perfect Elimination Bipartite Graphs