Linear-time recognition of bipartite graphs plus two edges

Authors:
Peter Damaschke
Affiliations:
Computing Sciences, Chalmers University, 41296 Göteborg, Sweden
Venue:
Discrete Mathematics
Year:
2003

Citing 10
Cited 0

Fast algorithms for finding nearest common ancestors

SIAM Journal on Computing
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Complexity of circuit intersection in graphs

Discrete Mathematics
Fixed-parameter tractability of graph modification problems for hereditary properties

Information Processing Letters
A polynomial approximation algorithm for the minimum fill-in problem

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding almost-satisfying assignments

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Obstructions to Within a Few Vertices or Edges of Acyclic

WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.06

Visualization

Abstract

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.