721 search results - page 60 / 145 » Bounds on the k-domination number of a graph |
172
click to vote
SIROCCO
2007
15 years 7 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
173
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
164
click to vote
AAAI
2006
15 years 7 months ago
2006
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
165
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
208
click to vote
COCO
1997
Springer
15 years 10 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...