A note on labeling schemes for graph connectivity
From MaRDI portal
Publication:763487
DOI10.1016/J.IPL.2011.10.001zbMATH Open1232.05203OpenAlexW2008343880MaRDI QIDQ763487FDOQ763487
Authors: Rani Izsak, Zeev Nutov 
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.10.001
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Connectivity (05C40) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Labeling Schemes for Flow and Connectivity
- Title not available (Why is that?)
- Implicat Representation of Graphs
- An unexpected result in coding the vertices of a graph
- Distance labeling in graphs (extended abstract)
- Labeling schemes for dynamic tree networks
- Distributed verification of minimum spanning trees
- Proximity-preserving labeling schemes
- An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- An optimal labeling for node connectivity
- General compact labeling schemes for dynamic trees
- Labeling schemes for vertex connectivity
- Title not available (Why is that?)
- Coding the vertexes of a graph
Cited In (8)
- Title not available (Why is that?)
- A note on labeling of graphs
- An algorithmic framework for labeling network maps
- An optimal labeling for node connectivity
- Title not available (Why is that?)
- Labeling Schemes for Vertex Connectivity
- Tight conditional lower bounds for vertex connectivity problems
- Labeling Schemes for Flow and Connectivity
This page was built for publication: A note on labeling schemes for graph connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763487)
