An optimal labeling for node connectivity

DOI10.1007/978-3-642-10631-6_32MaRDI QIDQ3652218zbMATH OpenOpenAlexFDO

Authors Tai-Hsin Hsu, Hsueh-I Lu

Publication date 17 December 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-10631-6_32

Mathematics Subject Classification ID

Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Labeling Schemes for Vertex Connectivity
• A note on labeling schemes for graph connectivity
• Labeling schemes for vertex connectivity
• scientific article; zbMATH DE number 2119757
• Labeling Schemes for Flow and Connectivity

Cited in

(16)

• Labeling schemes for vertex connectivity
• Vertex labeling and routing in self-similar outerplanar unclustered graphs modeling complex networks
• Labeling Schemes for Flow and Connectivity
• scientific article; zbMATH DE number 2119757 (Why is no real title available?)
• scientific article; zbMATH DE number 222693 (Why is no real title available?)
• Labeling Schemes for Vertex Connectivity
• Maximum information stored in a labeled connected network with minimum edges
• Fault-tolerant distance labeling for planar graphs
• Fault-tolerant distance labeling for planar graphs
• Better distance labeling for unweighted planar graphs
• Space complexity of vertex connectivity oracles
• Data structures for node connectivity queries
• The structure of minimum vertex cuts
• Near-optimal vertex fault-tolerant labels for Steiner connectivity
• A note on labeling schemes for graph connectivity
• Better distance labeling for unweighted planar graphs

This page was built for publication: An optimal labeling for node connectivity

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