Algorithms - ESA 2003
From MaRDI portal
Publication:5897251
DOI10.1007/b13632zbMath1266.05019WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897251
Cyril Gavoille, Christophe Paul
Publication date: 3 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13632
68R10: Graph theory (including graph drawing) in computer science
05C12: Distance in graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
68P05: Data structures
68W25: Approximation algorithms
Related Items
Distributed Relationship Schemes for Trees, Short Labels by Traversal and Jumping, Representation of graphs by OBDDs, Localized and compact data-structure for comparability graphs, Tree-decompositions with bags of small diameter, Distance Labeling for Permutation Graphs