| Accession number;05A0123154 |
| Title;GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS |
| Author;NAGAMOCHI H(Kyoto Univ.) |
Journal Title;J Oper Res Soc Jpn
|
Journal Code:G0402A
|
ISSN:
|
|
VOL.47;NO.4;PAGE.199-223(2004)
|
| Figure&Table&Reference;FIG.6, REF.47 |
| Pub. Country;Japan |
| Language;English |
| Abstract;This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings. (author abst.) |
