1447 search results - page 81 / 290 » Graphs and Path Equilibria |
126
click to vote
ICN
2005
Springer
15 years 9 months ago
2005
Springer
It is shown that the de Bruijn graph (dBG) can be used as an architecture for interconnection networks and a suitable structure for parallel computation. Recent works have classiï¬...
123
click to vote
VISSYM
2007
15 years 6 months ago
2007
For displaying a dense graph, an adjacency matrix is superior than a node-link diagram because it is more compact and free of visual clutter. A node-link diagram, however, is far ...
110
click to vote
ICCAD
2006
IEEE
16 years 28 days ago
2006
IEEE
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
148
click to vote
ICPP
2009
IEEE
15 years 10 months ago
2009
IEEE
We present a new parallel algorithm that extends and generalizes the traditional graph analysis metric of betweenness centrality to include additional non-shortest paths according...
130
click to vote
IWPEC
2009
Springer
15 years 10 months ago
2009
Springer
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...