1986 search results - page 303 / 398 » Path Separability of Graphs |
117
click to vote
JCSS
2011
14 years 9 months ago
2011
The bandwidth of an n-vertex graph G is the minimum value b such that the vertices of G can be mapped to distinct integer points on a line without any edge being stretched to a di...
122
click to vote
HOTNETS
2010
14 years 9 months ago
2010
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
129
Voted
AAAI
2011
14 years 2 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
161
click to vote
ISCA
2012
IEEE
13 years 4 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...
141
click to vote
PODC
2004
ACM
15 years 7 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...