Compact Navigation and Distance Oracles for Graphs with Small Treewidth
type: Item
instance of: scholarly article
title: Compact Navigation and Distance Oracles for Graphs with Small Treewidth
zbMATH Open document ID: 1332.68170
DOI: 10.1007/978-3-642-22006-7_23
author: Arash Farzan
author: Shahin Kamali
published in: Automata, Languages and Programming
publication date: 2011-07-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 5917968
MaRDI profile type: Publication
full work available at URL: 978-3-642-22006-7 23
OpenAlex ID: W65368251
cites work: Succinct Representation of Labeled Graphs
cites work: Q4471358
cites work: Succinct Representations of Separable Graphs
cites work: Q4291429
cites work: Treewidth: Characterizations, Applications, and Computations
cites work: All-pairs shortest paths for unweighted undirected graphs in o(mn) time
cites work: Graph treewidth and geometric thickness parameters
cites work: Succinct Representations of Arbitrary Graphs
cites work: Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
cites work: Q4471381
cites work: Q3734422
cites work: Succinct Ordinal Trees Based on Tree Covering
cites work: On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
cites work: Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
description: scientific article