A Highly Efficient Algorithm to Determine Bicritical Graphs

Authors:
Dingjun Lou;Ning Zhong
Affiliations:
-;-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 3
Cited 0

Graphs and algorithms

Graphs and algorithms
Graph Theory With Applications

Graph Theory With Applications
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we show a necessary and sufficient condition which characterizes all bicritical graphs. Using this necessary and sufficient condition we develop a highly efficient algorithm to determine whether a graph is bicritical, of which the time complexity is bounded by O (|V||E|), and this is the best result that has ever been known.