scientific article; zbMATH DE number 139775

zbMATH Open0768.68167MaRDI QIDQ4028098FDOQ4028098

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

Publication date: 28 March 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (8)

• Optimal parallel randomized algorithms for sparse addition and identification
• Title not available (Why is that?)
• Optimal parallel algorithms on planar graphs
• Multi-priority graph sparsification
• Parallel Symmetry-Breaking in Sparse Graphs
• Title not available (Why is that?)
• Efficient parallel graph algorithms for coarse-grained multicomputers and BSP
• Efficient parallel algorithms for shortest paths in planar graphs

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)