scientific article; zbMATH DE number 139775

MaRDI QIDQ4028098zbMATH OpenFDO

Authors Grammati Pantziou, P. G. Spirakis, Christos Zaroliagis

Publication date 28 March 1993

zbMATH Keywords

bounded degree graphscoloringgeneral list rankingHamiltonian pathindependent setmatchingparallel algorithmsplanar graphsrectangular grid graphssparse graphstrees

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Optimal parallel algorithms on planar graphs
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
• scientific article; zbMATH DE number 4060742
• Efficient parallel algorithms for series parallel graphs
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

Cited in

(9)

• Optimal parallel randomized algorithms for sparse addition and identification
• Efficient computation of implicit representations of sparse graphs
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• scientific article; zbMATH DE number 4060742 (Why is no real title available?)
• scientific article; zbMATH DE number 4087453 (Why is no real title available?)
• Parallel Symmetry-Breaking in Sparse Graphs
• Efficient parallel algorithms for shortest paths in planar graphs
• Optimal parallel algorithms on planar graphs
• Multi-priority graph sparsification

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4028098)