1986 search results - page 193 / 398 » Path Separability of Graphs |
127
click to vote
FPL
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents a new approach for mapping task graphs to heterogeneous hardware/software computing systems using heuristic search techniques. Two techniques: (1) integration ...
109
click to vote
KBSE
2010
IEEE
15 years 8 days ago
2010
IEEE
This paper proposes GenericDiff, a general framework for model comparison. The main idea is to separate the specification of domain-specific model properties and syntax from the g...
136
click to vote
SPAA
2006
ACM
15 years 8 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
136
click to vote
COMGEO
2007
ACM
15 years 2 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
90
Voted
RSA
2006
15 years 2 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...