On the hardness of constructing minimal 2-connected...

Theoretical Computer Science 2004 Vol. 326; Iss. 1-3

On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality

Hans-Joachim Böckenhauer, Dirk Bongartz, Juraj Hromkovič, Ralf Klasing, Guido Proietti, Sebastian Seibert, Walter Unger
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:
326
Year:
2004
Language:
english
Pages:
17
DOI:
10.1016/j.tcs.2004.06.019
File:
PDF, 286 KB
english, 2004
Conversion to is in progress
Conversion to is failed