Efficient Algorithms for Tripartitioning Triconnected Graphs and 3-Edge-Connected Graphs

Authors:
Koichi Wada;Kimio Kawaguchi
Affiliations:
-;-
Venue:
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1993

Citing 0
Cited 3

Bisecting Two Subsets in 3-Connected Graphs

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Bisecting a 4-connected graph with three resource sets

Discrete Applied Mathematics
Bisecting a four-connected graph with three resource sets

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract