A simple nc recognition algorithm for welsh-powell opposition graphs

DOI10.1080/00207169108804025zbMath0742.68049OpenAlexW1996736446MaRDI QIDQ3989765

No author found.

Publication date: 28 June 1992

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169108804025

zbMATH Keywords

heuristicsparallel algorithmsgraph colouringNC recognition algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Characterization and recognition of some opposition and coalition graph classes

Cites Work

• Unnamed Item
• Welsh-Powell opposition graphs
• Bounds to Complexities of Networks for Sorting and for Switching
• An upper bound for the chromatic number of a graph and its application to timetabling problems

This page was built for publication: A simple nc recognition algorithm for welsh-powell opposition graphs