scientific article; zbMATH DE number 1929938

zbMATH Open1014.68238MaRDI QIDQ4708570FDOQ4708570

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

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

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

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)

Cited In (7)

• Mathematical Foundations of Computer Science 2005
• Title not available (Why is that?)
• Solving NP-hard semirandom graph problems in polynomial expected time
• Finding Large Independent Sets in Polynomial Expected Time
• Automata, Languages and Programming
• Title not available (Why is that?)
• 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)