Report 7/2006: Algorithmic Graph Theory (February 12th -- February 18th, 2006)

DOI10.4171/OWR/2006/07MaRDI QIDQ873854zbMATH OpenOpenAlexFDO

Authors

Publication date 20 March 2007

Published in Oberwolfach Reports (Search for Journal in Brave)

Full work available at URL http://www.ems-ph.org/journals/show_abstract.php?issn=1660-8933&vol=3&iss=1&rank=7

Mathematics Subject Classification ID

Collections of abstracts of lectures (00B05) Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Graph algorithms (graph-theoretic aspects) (05C85) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Graph theory (including graph drawing) in computer science (68R10) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)

Recommendations

• New approximation algorithms for graph coloring
• Graph colouring algorithms
• Graphs with small chromatic numbers are easy to color
• scientific article; zbMATH DE number 1984543
• An improved algorithm for approximating the chromatic number of \(G_{n,p}\)

This page was built for publication: Report 7/2006: Algorithmic Graph Theory (February 12th -- February 18th, 2006)

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