Adjacency queries in dynamic sparse graphs
type: Item
instance of: scholarly article
title: Adjacency queries in dynamic sparse graphs
zbMATH Open document ID: 1184.68202
author: Łukasz Kowalik
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5664804
zbMATH Keywords: data structures
zbMATH Keywords: graph algorithms
zbMATH Keywords: adjacency
zbMATH Keywords: orientation
zbMATH Keywords: dynamic
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.12.006
OpenAlex ID: W2041955583
cites work: Tight(er) worst-case bounds on dynamic searching and priority queues
cites work: Optimal bounds for the predecessor problem and related problems
cites work: Q3024792
cites work: Planar orientations with low out-degree and compaction of adjacency matrices
cites work: Dynamic Perfect Hashing: Upper and Lower Bounds
cites work: Surpassing the information theoretic bound with fusion trees
cites work: Algorithms – ESA 2004
cites work: Oracles for bounded-length shortest paths in planar graphs
cites work: On the Complexity of a Game Related to the Dictionary Problem
cites work: Algorithms and Data Structures
cites work: Decomposition of Finite Graphs Into Forests
DOI: 10.1016/J.IPL.2006.12.006
description: scientific article; zbMATH DE number 5664804