5889 search results - page 133 / 1178 » Graph Layout Problems |
134
Voted
GD
2009
Springer
15 years 5 days ago
2009
Springer
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
104
click to vote
SIAMDM
2008
15 years 2 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
113
click to vote
WEA
2004
Springer
15 years 7 months ago
2004
Springer
A homogeneous set is a non-trivial, proper subset of a graph’s vertices such that all its elements present exactly the same outer neighborhood. Given two graphs, G1(V, E1), G2(V,...
113
Voted
DAM
2007
15 years 2 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
114
click to vote
STACS
2001
Springer
15 years 6 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...