The MathNet Korea
Information Center for Mathematical Science

논문검색

Information Center for Mathematical Science

논문검색

SIAM Journal on Computing
( Vol. 29 NO.5 / (2000))
Maintenance of 2- and 3-Edge-Connected Components of Graphs II
Han La Poutre,
Pages. 1521-1549
Abstract
Contents 1. Introduction 2. Preliminaries 3. Fractionally rooted trees: Concept and operations 4. Two-edge-connectivity 5. Fractionally rooted trees: Observations and ideas 6. Division trees 7. Fractionally rooted trees: The data structure 8. Complexity of FRT(i) 9. FRT structures 10. 3-edge-connectivity 11. A solution for 2-vertex-connectivity 12. Concluding remarks
Key words analysis of algorithms, dynamic data structures, edge connectivity, vertex connectivity
Mathmatical Subject Classification 68P05, 68Q20, 68R10