The algorithmic complexity of colour switching

DOI10.1016/0020-0190(92)90013-LMaRDI QIDQ1199936zbMATH OpenWikidataFDO

Authors Yeow Meng Chee, Andrew Lim

Publication date 17 January 1993

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

zbMATH Keywords

channel allocationgraph colouringweighted 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)

Recommendations

• Algorithmic complexity of list colorings
• On the fine-grained complexity of rainbow coloring
• On the fine-grained complexity of rainbow coloring
• The complexity of grid coloring
• Fine-grained complexity of rainbow coloring and its variants
• Fine-Grained Complexity of Rainbow Coloring and its Variants.
• The complexity of multicolouring
• Complexity of coloring reconfiguration under recolorability constraints

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Faster Scaling Algorithms for Network Problems
• Maximum matching and a polyhedron with 0,1-vertices

Cited in

(2)

• scientific article; zbMATH DE number 1390132 (Why is no real title available?)
• Complexity of hypergraph coloring and Seidel's switching.

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1199936)