215 search results - page 15 / 43 » On extremal k-outconnected graphs |
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
ICPADS
2006
IEEE
14 years 2 months ago
2006
IEEE
While most parallel task graphs scheduling research has been done in the context of single homogeneous clusters, heterogeneous platforms have become prevalent and are extremely at...
COLT
2010
Springer
13 years 6 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
CIKM
2009
Springer
14 years 11 days ago
2009
Springer
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...