On Four-Connecting a Triconnected Graph
β
Tsan-sheng Hsu
π
Article
π
2000
π
Elsevier Science
π
English
β 328 KB
We consider the problem of finding a smallest set of edges whose addition four-connects a triconnected graph. This is a fundamental graph-theoretic problem that has applications in designing reliable networks and improving statistical Ε½ Ε½ . . database security. We present an O n ΠΈ β£ m, n q m -time a