646 search results - page 11 / 130 » Generalized connected domination in graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
: We consider a class of point processes, which we call sub-Poisson; these are point processes that can be directionallyconvexly (dcx) dominated by some Poisson point process. The ...
COCOON
2007
Springer
14 years 2 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
ACSC
2007
IEEE
14 years 3 months ago
2007
IEEE
This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
DM
2007
13 years 8 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
JCO
2007
13 years 8 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...