Labeling Schemes for Vertex Connectivity

DOI10.1007/978-3-540-73420-8_11zbMath1171.05430OpenAlexW1481375110MaRDI QIDQ5428801

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 algorithmsvertex-connectivitylabeling schemes

Mathematics Subject Classification ID

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

Related Items (5)

Proof labeling schemes ⋮ Compact separator decompositions in dynamic trees and applications to labeling schemes ⋮ General compact labeling schemes for dynamic trees ⋮ Randomized proof-labeling schemes ⋮ A note on models for graph representations

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