scientific article; zbMATH DE number 1875441
From MaRDI portal
Publication:4796200
zbMath1006.68957MaRDI QIDQ4796200
Publication date: 2 March 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2161/21610524
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (6)
Analysis of greedy algorithms on graphs with bounded degrees ⋮ Randomized greedy algorithms for finding smallk-dominating sets of regular graphs ⋮ A structural approach for independent domination of regular graphs ⋮ Connected domination of regular graphs ⋮ An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm ⋮ Independent dominating sets in graphs of girth five
This page was built for publication:
