370 search results - page 2 / 74 » Independent Sets with Domination Constraints |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
RSA
2002
14 years 9 months ago
2002
100
click to vote
FCS
2009
14 years 7 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
CL
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. Dominance constraints are widely used in computational linguistics as a language for talking and reasoning about trees. In this paper, we extend dominance constraints by ...
97
Voted
DC
2010
14 years 9 months ago
2010
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...