1477 search results - page 14 / 296 » Complexity of (iterated) dominance |
191
click to vote
MOBIHOC
2002
ACM
16 years 5 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
153
click to vote
ADCM
2004
15 years 6 months ago
2004
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
181
click to vote
WAOA
2010
Springer
15 years 3 months ago
2010
Springer
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
158
click to vote
JMIV
2006
15 years 6 months ago
2006
Vector field segmentation methods usually belong to either of three classes: methods which segment regions homogeneous in direction and/or norm, methods which detect discontinuiti...
151
click to vote
ACSC
2007
IEEE
16 years 12 days 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. ...