Using Bounded Degree Spanning Trees in the Design of Efficient Algorihtms on Claw-Free Graphs

Authors:
Marek Chrobak;Joseph (Seffi) Naor;Mark B. Novick
Affiliations:
-;-;-
Venue:
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Year:
1989

Citing 0
Cited 3

A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Line-of-sight networks

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Line-of-sight networks

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract