Linear-time recognition of bipartite graphs plus two edges
Artikel i vetenskaplig tidskrift, 2003

Cai and Schieber (1997) proved that bipartite graphs plus one edge can be recognized in linear time. We extend their result to bipartite graphs plus two edges. Our algorithm works on a depth-first-search spanning tree. This gives, as a byproduct, also a simplified solution to the one-edge case. It is a notoriously open question whether recognizing bipartite graphs plus $k$ edges is a fixed-parameter tractable problem. The present result might support the affirmative conjecture.

algorithms and data structures

recognizing graph properties

parametric complexity

tree computations

Författare

Peter Damaschke

Chalmers, Institutionen för datavetenskap, Algoritmer

Discrete Mathematics

0012-365X (ISSN)

Vol. 262 99-112

Ämneskategorier

Data- och informationsvetenskap

DOI

10.1016/S0012-365X(02)00493-4