Short Labels by Traversal and Jumping

DOI10.1007/11780823_12MaRDI QIDQ5901482zbMATH OpenOpenAlexFDO

Authors Nicolas Bonichon, Cyril Gavoille, Arnaud Labourel

Publication date 12 March 2009

Published in Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11780823_12

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Short Labels by Traversal and Jumping
• A generalization of jumps and labels
• An extension of labeling techniques for finding shortest path trees
• Shorter Labeling Schemes for Planar Graphs
• Shorter Labeling Schemes for Planar Graphs
• Succinct representation of labeled trees
• An efficient label setting/correcting shortest path algorithm
• A simple and fast label correcting algorithm for shortest paths
• Simpler, faster and shorter labels for distances in graphs
• Succinct Representation of Labeled Graphs

Cited in

(3)

• scientific article; zbMATH DE number 1830738 (Why is no real title available?)
• Shorter Labeling Schemes for Planar Graphs
• Short Labels by Traversal and Jumping

This page was built for publication: Short Labels by Traversal and Jumping

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