20 search results - page 1 / 4 » Distance Domination and Distance Irredundance in Graphs |
COMBINATORICS
2007
13 years 4 months ago
2007
WG
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
SWAT
1994
Springer
13 years 9 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
TCS
2008
13 years 4 months ago
2008
Abstract. Many graph problems seem to require knowledge that extends beyond the immediate neighbors of a node. The usual self-stabilizing model only allows for nodes to make decisi...
WG
2005
Springer
13 years 10 months ago
2005
Springer
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...