37 search results - page 6 / 8 » On connectivity of consecutive-d digraphs |
ARSCOM
1998
14 years 11 months ago
1998
Some results relating to the road-coloring conjecture of Alder, Goodwyn, and Weiss, which give rise to an O(n2) algorithm to determine whether or not a given edge-coloring of a gra...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
ICML
2007
IEEE
16 years 18 days ago
2007
IEEE
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
CDC
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— This paper addresses passivity-based output synchronization and a collision avoidance problem of rigid bodies in the Special Euclidean group SE(3) under the assumption ...
104
click to vote
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
d Abstract) Noga Alon∗ Fedor V. Fomin† Gregory Gutin‡ Michael Krivelevich§ Saket Saurabh¶ We prove that finding a rooted subtree with at least k leaves in a directed grap...