Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.05019OpenAlexW1827234103WikidataQ60299159 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

zbMATH Keywords

interval graphscircular-arc graphsdata structuredistance labeling schemedistance queries

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Data structures (68P05) Approximation algorithms (68W25)

Related Items (6)

Tree-decompositions with bags of small diameter ⋮ Distributed Relationship Schemes for Trees ⋮ Representation of graphs by OBDDs ⋮ Localized and compact data-structure for comparability graphs ⋮ Short Labels by Traversal and Jumping ⋮ Distance Labeling for Permutation Graphs

This page was built for publication: Algorithms - ESA 2003