Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
From MaRDI portal
Publication:612969
zbMath1204.05090MaRDI QIDQ612969
William Duckworth, Nicholas C. Wormald
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/226613
Related Items
Approximation hardness of edge dominating set problems, Minimum independent dominating sets of random cubic graphs, Minimum maximal matchings in cubic graphs, Independent dominating sets in regular graphs, On the independent domination number of regular graphs, A tight bound for independent domination of cubic graphs without 4‐cycles, A structural approach for independent domination of regular graphs, Connected domination of regular graphs