Augmenting a (k - 1)-Vertex-Connected Multigraph ℓ-Edge-Connected and k-Vertex-Connected Multigraph

Uložené v:
Podrobná bibliografia
Vydané v:Algorithmica Ročník 44; číslo 3; s. 257 - 280
Hlavní autori: Ishii, Toshimasa, Nagamochi, Hiroshi, Ibaraki, Toshihide
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York, NY Springer Science and Business Media LLC 01.04.2006
Springer
Predmet:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Polynomial approximation
Multigraph
Polynomial method
Approximation algorithm
Optimization
Undirected multigraph
Polynomial time
Optimum
Edge-connectivity
Graph augmentation
Deterministic algorithm
Vertex-connectivity
Polynomial time approximation algorithm
Deterministic algorithms
ISSN:0178-4617, 1432-0541
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-005-1151-4