scientific article; zbMATH DE number 1929938

MaRDI QIDQ4708570zbMATH OpenFDO

Authors Amin Coja-Oghlan

Publication date 18 June 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200201.htm

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Solving NP-hard semirandom graph problems in polynomial expected time
• Automata, Languages and Programming
• Mathematical Foundations of Computer Science 2005
• Algorithms for coloring semi-random graphs
• scientific article; zbMATH DE number 2019631

Cited in

(7)

• Mathematical Foundations of Computer Science 2005
• scientific article; zbMATH DE number 2019631 (Why is no real title available?)
• Solving NP-hard semirandom graph problems in polynomial expected time
• Finding Large Independent Sets in Polynomial Expected Time
• Automata, Languages and Programming
• scientific article; zbMATH DE number 1962840 (Why is no real title available?)
• Deciding \(k\)-colorability in expected polynomial time

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