Large 2-independent sets of regular graphs

MaRDI QIDQ2843924zbMATH OpenFDO

Authors W. Duckworth, M. Zito

Publication date 27 August 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066104810156

zbMATH Keywords

algorithmdifferential equationsfinding large 2-independent set of regular graphsheuristicrandom regular graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• scientific article; zbMATH DE number 1933049
• Large independent sets in random regular graphs
• Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
• Experimental and Efficient Algorithms
• Randomized greedy algorithms for independent sets and matchings in regular graphs: exact results and finite girth corrections

Cited in

(9)

• Large independent sets in random regular graphs
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
• Large independent sets in regular graphs of large girth
• On inertia and ratio type bounds for the k-independence number of a graph and their relationship
• Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs
• Randomized greedy algorithms for independent sets and matchings in regular graphs: exact results and finite girth corrections
• scientific article; zbMATH DE number 1933049 (Why is no real title available?)
• Spectral bounds for the \(k\)-independence number of a graph
• On the k-independence number of graph products

This page was built for publication: Large 2-independent sets of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843924)