scientific article; zbMATH DE number 956843

MaRDI QIDQ5687250zbMATH OpenFDO

Authors Mark G. Brockington, J. Culberson

Publication date 31 March 1997

zbMATH Keywords

DELTArandom graph generation system

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On the independent set problem in random graphs
• Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
• Independent sets in random sparse graphs
• On the probability of independent sets in random graphs
• Constructions of independent sets in random intersection graphs
• On the independence number of random graphs
• Independent sets in quasi-regular graphs
• Independent sets in semi-random hypergraphs

Cited in

(8)

• Simple ingredients leading to very efficient heuristics for the maximum clique problem
• Reactive and dynamic local search for max-clique: engineering effective building blocks
• Phased local search for the maximum clique problem
• A new trust region technique for the maximum weight clique problem
• A study of ACO capabilities for solving the maximum clique problem
• Tradeoffs in the Complexity of Backdoor Detection
• Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
• The combinatorics of pivoting for the maximum weight clique.

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