The algorithmic complexity of colour switching

DOI10.1016/0020-0190(92)90013-LzbMath0764.68110WikidataQ126857207 ScholiaQ126857207MaRDI QIDQ1199936

Yeow Meng Chee, Andrew E. B. Lim

Publication date: 17 January 1993

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

graph colouringchannel allocationweighted matching problemcolour switching problem

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) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Faster Scaling Algorithms for Network Problems
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: The algorithmic complexity of colour switching