Kasai Takumi

Takumi Kasai

Information about the author Takumi Kasai will soon be added to the site.
Found 1 papers in total
Parallel algorithms for the maximal tree cover problems
1992
A maximal l- diameter tree cover of a graph G=(V,E) is a spanning subgraph C=(V,E C )...
Papers per page: