An approximation algorithm for the achromatic number of mesh-like topologies

MaRDI QIDQ5441749zbMATH OpenFDO

Authors Sharmila Mary Arul, Albert William, Indra Rajasingh, Bharati Rajan

Publication date 15 February 2008

zbMATH Keywords

achromatic numberapproximation algorithmsgraph algorithmshoneycomb networksNP-completeness

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximation algorithms for the achromatic number.
• On the achromatic number of certain distance graphs
• scientific article; zbMATH DE number 6096704
• scientific article; zbMATH DE number 1405798
• Efficient approximation algorithms for the achromatic number

Cited in

(3)

• Approximation algorithms for the achromatic number.
• scientific article; zbMATH DE number 1405798 (Why is no real title available?)
• On the achromatic number of certain distance graphs

This page was built for publication: An approximation algorithm for the achromatic number of mesh-like topologies

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