scientific article; zbMATH DE number 1962840

MaRDI QIDQ4418677zbMATH OpenFDO

Authors Amin Coja-Oghlan

Publication date 11 August 2003

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

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Finding Large Independent Sets in Polynomial Expected Time
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Finding a Maximum Independent Set in a Sparse Random Graph
• Heuristics for semirandom graph problems
• scientific article; zbMATH DE number 1929938

Cited in

(9)

• Heuristics for semirandom graph problems
• Faster exponential-time algorithms for approximately counting independent sets
• Approximating independent set in perturbed graphs
• Exponential Time Complexity of Weighted Counting of Independent Sets
• Finding Large Independent Sets in Polynomial Expected Time
• Finding a Maximum Independent Set in a Sparse Random Graph
• Exact and approximative algorithms for coloring G(n,p)
• Independent sets in graphs
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

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