External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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.

Authors

Koichi Wada

This author has not been identified. Look up 'Koichi Wada' in Google

Akinari Takaki

This author has not been identified. Look up 'Akinari Takaki' in Google

Kimio Kawaguchi

This author has not been identified. Look up 'Kimio Kawaguchi' in Google
runs on