Title of article
Two-Connected Augmentation Problems in Planar Graphs
Author/Authors
J. Scott Provan، نويسنده , , Roger C. Burk، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1999
Pages
21
From page
87
To page
107
Keywords
Planar graphs , Biconnectivity , multicommodity cuts , Network design , Vulnerability , Augmentation
Journal title
Journal of Algorithms
Serial Year
1999
Journal title
Journal of Algorithms
Record number
291347
Link To Document