9532 search results - page 395 / 1907 » Logic, Graphs, and Algorithms |
164
click to vote
FOCS
1994
IEEE
15 years 11 months ago
1994
IEEE
We show that two cooperating robots can learn exactly any strongly-connected directed graph with n indistinguishable nodes in expected time polynomial in n. We introduce a new typ...
188
click to vote
COMGEO
2004
ACM
15 years 6 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
160
click to vote
DAC
1993
ACM
15 years 11 months ago
1993
ACM
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the numbe...
167
click to vote
ICCSA
2010
Springer
15 years 8 months ago
2010
Springer
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...
176
click to vote
ESANN
2006
15 years 8 months ago
2006
Complex networks have received much attention in the last few years, and reveal global properties of interacting systems in domains like biology, social sciences and technology. O...