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 3894489

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

zbMATH Open0561.68051MaRDI QIDQ5186751FDOQ5186751


Authors: A. A. Shnejder Edit this on Wikidata


Publication date: 1984



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



Recommendations

  • Publication:5752591
  • New graph coloring algorithms
  • scientific article; zbMATH DE number 3841898
  • Numerical experiences with graph coloring algorithms
  • Some sequential graph colouring algorithms


zbMATH Keywords

comparative analysisefficiency of heuristic algorithmslarge-scale experimental study


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) Algorithms in computer science (68W99)



Cited In (3)

  • A classifier system using smooth graph coloring
  • New graph coloring algorithms
  • A wide-ranging computational comparison of high-performance graph colouring algorithms





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 Q5186751)

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