scientific article

zbMATH Open0666.68068MaRDI QIDQ3817629FDOQ3817629

Samir Khuller

Publication date: 1988

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

zbMATH Keywords

graph coloringparallel algorithmsplanar graphsmaximal independent setsdepth first search\(K_{3,3}\)-free graphsfive colorable

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (1)

• NC algorithms for computing the number of perfect matchings in \(K_{3,3}\)-free graphs and related problems

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 Q3817629)