Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases

Koichi Wada, Akinari Takaki, Kimio Kawaguchi. Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. In Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer, editors, Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG 94, Herrsching, Germany, June 16-18, 1994, Proceedings. Volume 903 of Lecture Notes in Computer Science, pages 319-330, Springer, 1994.

Abstract

Abstract is missing.