1986 search results - page 148 / 398 » Path Separability of Graphs |
ASPLOS
2006
ACM
15 years 8 months ago
2006
ACM
Growing on-chip wire delays are motivating architectural features that expose on-chip communication to the compiler. EDGE architectures are one example of communication-exposed mi...
121
Voted
ESA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
137
click to vote
IPSN
2011
Springer
14 years 5 months ago
2011
Springer
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
135
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
125
Voted
KBSE
2007
IEEE
15 years 8 months ago
2007
IEEE
Effective bug localization is important for realizing automated debugging. One attractive approach is to apply statistical techniques on a collection of evaluation profiles of pr...