Localized and compact data-structure for comparability graphs
Authors:
- 1 June 2009
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 309 (11) , 3465-3484
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Distance and routing labeling schemes for non-positively curved plane graphsJournal of Algorithms, 2006
- Oracles for bounded-length shortest paths in planar graphsACM Transactions on Algorithms, 2006
- Approximate distance oraclesJournal of the ACM, 2005
- Distance labeling in graphsJournal of Algorithms, 2004
- Compact and localized distributed data structuresDistributed Computing, 2003
- Shortest Paths in Digraphs of Small Treewidth. Part I: Sequential AlgorithmsAlgorithmica, 2000
- Faster Shortest-Path Algorithms for Planar GraphsJournal of Computer and System Sciences, 1997
- A linear-time algorithm for proper interval graph recognitionInformation Processing Letters, 1995
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applicationsAlgorithmica, 1995
- Simple linear time recognition of unit interval graphsInformation Processing Letters, 1995