A highly efficient algorithm to determine bicritical graphs

DOI10.1007/3-540-44679-6_38MaRDI QIDQ4551374zbMATH OpenFDO

Authors Dingjun Lou, Ning Zhong

Publication date 5 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080349

zbMATH Keywords

bicritical graphshighly efficient algorithm

Mathematics Subject Classification ID

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

Recommendations

• An efficient algorithm to test potential bipartiteness of graphical degree sequences
• A linear time algorithm for determining almost bipartite graphs
• Efficient algorithms for finding critical subgraphs
• Algorithmic aspects of bipartite graphs
• An efficient algorithm for graph bisection of triangularizations
• A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
• AN ALGORITHM FOR FINDING A MAXIMUM CYCLE OF BIPARTITE GRAPHS WITH LARGE DEGREES
• scientific article; zbMATH DE number 1522753
• Branch and cut algorithms for detecting critical nodes in undirected graphs
• Finding bipartite subgraphs efficiently

Cited in

(4)

• Graphs with no \(M\)-alternating path between two vertices
• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• scientific article; zbMATH DE number 1522753 (Why is no real title available?)
• scientific article; zbMATH DE number 2208652 (Why is no real title available?)

This page was built for publication: A highly efficient algorithm to determine bicritical graphs

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