scientific article
From MaRDI portal
Publication:2843924
zbMath1270.05092MaRDI QIDQ2843924
No author found.
Publication date: 27 August 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066104810156
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmdifferential equationsrandom regular graphsheuristicfinding large 2-independent set of regular graphs
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (3)
On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
This page was built for publication:
