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

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 44; no. 3; pp. 257 - 280
Main Authors:	Ishii, Toshimasa, Nagamochi, Hiroshi, Ibaraki, Toshihide
Format:	Journal Article
Language:	English
Published:	New York, NY Springer Science and Business Media LLC 01.04.2006 Springer
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
ISSN:	0178-4617 1432-0541
DOI:	10.1007/s00453-005-1151-4