Kawaguchi Kimio

Kimio Kawaguchi

Information about the author Kimio Kawaguchi will soon be added to the site.
Found 3 papers in total
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
1995
This paper describes efficient algorithms for partitioning a k -edge-connected graph...
Efficient fault-tolerant fixed routings on -connected digraphs
Efficient fault-tolerant fixed routings on -connected digraphs
1992
Consider a directed communication network G in which a limited number of directed link...
The upper and lower bounds on the area of a generalized graph embedding
The upper and lower bounds on the area of a generalized graph embedding
1989
The authors discuss the upper and lower bounds on an area to embed an n- vertex and d...
Papers per page: