scientific article; zbMATH DE number 2019631

MaRDI QIDQ4440434zbMATH OpenFDO

Authors Amin Coja-Oghlan

Publication date 17 December 2003

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

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

Cited in

(2)

• scientific article; zbMATH DE number 1929938 (Why is no real title available?)
• Semi-random Graphs with Planted Sparse Vertex Cuts: Algorithms for Exact and Approximate Recovery

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