On rooted node-connectivity problems

DOI10.1007/S00453-001-0017-7MaRDI QIDQ5945916zbMATH OpenOpenAlexFDO

Authors Joseph Cheriyan, Tibor Jordán, Zeev Nutov

Publication date 14 October 2001

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0017-7

zbMATH Keywords

graph connectivitymetric costsuniform costs

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1182763
• Approximating node connectivity problems via set covers
• scientific article; zbMATH DE number 1670542
• Approximating node-connectivity augmentation problems
• scientific article; zbMATH DE number 1542609

Cited in

(8)

• Rooted \(k\)-connections in digraphs
• On extremal \(k\)-outconnected graphs
• Property testing on \(k\)-vertex-connectivity of graphs
• The connected critical node problem
• scientific article; zbMATH DE number 1182763 (Why is no real title available?)
• A logarithmic approximation algorithm for the activation edge-multicover problem
• On shredders and vertex connectivity augmentation
• On minimum power connectivity problems

This page was built for publication: On rooted node-connectivity problems

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