scientific article; zbMATH DE number 2011847

zbMath1032.68167MaRDI QIDQ4437499

No author found.

Publication date: 2 December 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530083.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

random regular graphsdominating setsweakly-connected

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20)

Related Items (1)

Bounds relating the weakly connected domination number to the total domination number and the matching number

This page was built for publication: