1149 search results - page 108 / 230 » Minimally non-Pfaffian graphs |
170
click to vote
PPL
2008
15 years 6 months ago
2008
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linea...
119
click to vote
JCT
2007
15 years 6 months ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
245
click to vote
SIGMOD
2009
ACM
16 years 6 months ago
2009
ACM
Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the c...
161
click to vote
INFOCOM
2009
IEEE
16 years 29 days ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
169
click to vote
ICDCS
2006
IEEE
16 years 11 days ago
2006
IEEE
This paper is concerned with reducing communication costs when executing distributed user tasks in a sensor network. We take a service-oriented abstraction of sensor networks, whe...