Approximation algorithms for the achromatic number.

DOI10.1006/JAGM.2001.1192MaRDI QIDQ2775897zbMATH OpenOpenAlexWikidataFDO

Authors Amitabh Chaudhary, Sundar Vishwanathan

Publication date 8 July 2002

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2001.1192

zbMATH Keywords

achromatic numberapproximation algorithmcomplete coloringgraph algorithmsNP-completeness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• scientific article; zbMATH DE number 1405798
• An approximation algorithm for the achromatic number of mesh-like topologies
• On approximating the achromatic number
• An Improved Approximation of the Achromatic Number on Bipartite Graphs
• On approximating the achromatic number (preliminary version)

Cited in

(10)

• Efficient approximation algorithms for the achromatic number
• On approximating the achromatic number
• On approximating the achromatic number (preliminary version)
• On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem
• Achromatic number of fragmentable graphs
• An Improved Approximation of the Achromatic Number on Bipartite Graphs
• Minimum order of graphs with given coloring parameters
• scientific article; zbMATH DE number 1405798 (Why is no real title available?)
• On the achromatic number of certain distance graphs
• An approximation algorithm for the achromatic number of mesh-like topologies

This page was built for publication: Approximation algorithms for the achromatic number.

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