Extending planar graph algorithms to K3,3-free graphs

Authors:
S. Khuller
Affiliations:
-
Venue:
Information and Computation
Year:
1990

Citing 0
Cited 2

Tight upper bound on the number of edges in a bipartite K3,3-free or K5-free graph with an application

Information Processing Letters
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract