Labeling Schemes for Vertex Connectivity

DOI10.1007/978-3-540-73420-8_11MaRDI QIDQ5428801zbMATH OpenOpenAlexFDO

Authors Amos Korman

Publication date 28 November 2007

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73420-8_11

zbMATH Keywords

graph algorithmslabeling schemesvertex-connectivity

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

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

Cited in

(13)

• A note on models for graph representations
• General compact labeling schemes for dynamic trees
• Randomized proof-labeling schemes
• Proof labeling schemes
• Labeling schemes for vertex connectivity
• Compact separator decompositions in dynamic trees and applications to labeling schemes
• An optimal labeling for node 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?)
• Connectivity check in 3-connected planar graphs with obstacles
• Vertex labeling of spider graph
• A note on labeling schemes for graph connectivity

This page was built for publication: Labeling Schemes for Vertex Connectivity

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