Sequential and parallel algorithms to find a K5 minor

Authors:
André Kézdy;Patrick McGuinness
Affiliations:
-;-
Venue:
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Year:
1992

Citing 4
Cited 6

Parallel merge sort

SIAM Journal on Computing
Efficient Planarity Testing

Journal of the ACM (JACM)
Depth-First Search and Kuratowski Subgraphs

Journal of the ACM (JACM)
Finding Triconnected Components by Local Replacements

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming

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

Information Processing Letters
Paths Problems in Symmetric Logarithmic Space

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
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
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Journal of Computer and System Sciences
Optimization and recognition for K5-minor free graphs in linear time

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract