scientific article; zbMATH DE number 19774
From MaRDI portal
Publication:3979273
zbMATH Open0735.68067MaRDI QIDQ3979273FDOQ3979273
Authors: Peter Rajčáni 
Publication date: 26 June 1992
Title of this publication is not available (Why is that?)
Recommendations
- Optimal parallel 3-coloring algorithm for rooted trees and its applications
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
- Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
CRCW PRAM(Delta+1)- colouring of constant degree graphscolouring of planar graphsfinding a maximal independent set in a planar graphparallel algorithm for 3-colouring rooted trees
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (2)
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 Q3979273)
