scientific article; zbMATH DE number 2170479

MaRDI QIDQ4677976zbMATH OpenFDO

Authors Hemant Balakrishnan, Narsingh Deo

Publication date 23 May 2005

zbMATH Keywords

labellingapproximate parallel algorithmlarge degree first heuristic

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 2068175
• scientific article; zbMATH DE number 1953160
• scientific article; zbMATH DE number 1759423
• Experimental and Efficient Algorithms
• Radiocoloring in planar graphs: Complexity and approximations

Cited in

(2)

• scientific article; zbMATH DE number 1953160 (Why is no real title available?)
• scientific article; zbMATH DE number 2068175 (Why is no real title available?)

This page was built for publication:

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