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.
@inproceedings{WadaTK94,
title = {Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases},
author = {Koichi Wada and Akinari Takaki and Kimio Kawaguchi},
year = {1994},
tags = {graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/WadaTK94},
cites = {0},
citedby = {0},
pages = {319-330},
booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG 94, Herrsching, Germany, June 16-18, 1994, Proceedings},
editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer},
volume = {903},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-59071-4},
}