Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 2170479

From MaRDI portal
Publication:4677976
Jump to:navigation, search

zbMATH Open1064.05053MaRDI QIDQ4677976FDOQ4677976


Authors: Hemant Balakrishnan, Narsingh Deo Edit this on Wikidata


Publication date: 23 May 2005



Title of this publication is not available (Why is that?)



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


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)



Cited In (2)

  • Title not available (Why is that?)
  • Title not available (Why is that?)





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4677976&oldid=18896658"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 18:16. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki