scientific article; zbMATH DE number 139775

MaRDI QIDQ4028098zbMATHFDO

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

Publication date 28 March 1993

zbMATH Keywords

matchingtreesHamiltonian pathsparse graphsindependent setparallel algorithmsplanar graphscoloringbounded degree graphsgeneral list rankingrectangular grid graphs

Mathematics Subject Classification ID

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

(8)

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

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)