1986 search results - page 90 / 398 » Path Separability of Graphs |
108
Voted
VISSYM
2007
15 years 4 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 ...
ICCAD
2006
IEEE
15 years 11 months 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...
132
Voted
ICPP
2009
IEEE
15 years 9 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...
116
click to vote
IWPEC
2009
Springer
15 years 9 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...
151
click to vote
DILS
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Life science data sources represent a complex link-driven federation of publicly available Web accessible sources. A fundamental need for scientists today is the ability ...