Skip to main content
Conference Proceedings

A highly efficient algorithm to determine bicritical graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2108 349-356
DOI: 10.1007/3-540-44679-6_38
3Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Lou, D., & Zhong, N. (2001). A highly efficient algorithm to determine bicritical graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2108, pp. 349–356). Springer Verlag. https://doi.org/10.1007/3-540-44679-6_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free