scientific article; zbMATH DE number 2081003

MaRDI QIDQ4474101zbMATH OpenFDO

Authors A. Galluccio, Guido Proietti

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2223/22230345.htm

zbMATH Keywords

Hamiltonian pathnetwork survivabilityaugmentation2-edge connectivity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Connectivity (05C40) Communication networks in operations research (90B18)

Recommendations

• Polynomial time algorithms for 2-edge-connectivity augmentation problems
• Graph-Theoretic Concepts in Computer Science
• scientific article; zbMATH DE number 1979495
• Approximation algorithms for graph augmentation
• Approximation Algorithms for Graph Augmentation

Cited in

(5)

• Approximation and Online Algorithms
• The Hamiltonian Augmentation Problem and Its Applications to Graph Drawing
• On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
• Polynomial time algorithms for 2-edge-connectivity augmentation problems
• Graph-Theoretic Concepts in Computer Science

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4474101)