On k-Partitioning the n-Cube

Authors:
Sergej L. Bezrukov
Affiliations:
-
Venue:
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
1996

Citing 0
Cited 2

Decomposable trees: a polynomial algorithm for tripodes

Discrete Applied Mathematics
On bounds for the k-partitioning of graphs

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract