A linear-time algorithm for finding a sparsek-connected...

Algorithmica 1992 / 06 Vol. 7; Iss. 1-6

A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph

Hiroshi Nagamochi, Toshihide Ibaraki
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
7
Language:
english
Pages:
14
Journal:
Algorithmica
DOI:
10.1007/bf01758778
Date:
June, 1992
File:
PDF, 684 KB
english, 1992
Conversion to is in progress
Conversion to is failed