Last update: Sun Oct 15 02:56:11 MDT 2017
@Article{Wada:1998:EAM,
author = "Koichi Wada and Akinari Takaki and Kimio Kawaguchi",
title = "Efficient algorithms for a mixed $k$-partition problem
of graphs without specifying bases",
journal = j-THEOR-COMP-SCI,
volume = "201",
number = "1--2",
pages = "233--248",
day = "06",
month = jul,
year = "1998",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:21:54 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1998&volume=201&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cas/tree/store/tcs/sub/1998/201/1-2/2761.pdf",
acknowledgement = ack-nhfb,
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
}