Efficient computation of implicit representations of sparse graphs
type: Item
instance of: scholarly article
title: Efficient computation of implicit representations of sparse graphs
zbMATH Open document ID: 0890.68098
DOI: 10.1016/S0166-218X(97)00007-3
author: S. R. Arikati
author: Anil Maheshwari
author: Christos Zaroliagis
published in: Discrete Applied Mathematics
publication date: 1998-06-23T00:00:00Z
full work available at URL: dam
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1109929
zbMATH Keywords: graph algorithms
zbMATH Keywords: sparse graphs
zbMATH Keywords: parallel algorithm
MaRDI profile type: Publication
cites work: Minimum partition of a matroid into independent subsets
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Faster optimal parallel prefix sums and list ranking
cites work: Forests, frames, and games: Algorithms for matroid sums and applications
cites work: Parallel Symmetry-Breaking in Sparse Graphs
cites work: Optimal parallel algorithms on planar graphs
cites work: Optimal Parallel 5-Colouring of Planar Graphs
cites work: Use of matroid theory in operations research, circuits and systems theory
cites work: Q4023519
cites work: On Generic Rigidity in the Plane
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: Q4763421
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: Q3138887
cites work: Q4385515
description: scientific article; zbMATH DE number 1109929