557 search results - page 28 / 112 » Visualizing Weighted Edges in Graphs |
131
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
138
click to vote
WDAG
2007
Springer
15 years 9 months ago
2007
Springer
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disco...
133
Voted
ESA
2000
Springer
15 years 7 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
128
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
125
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
Efficient load balancing algorithms are the key to many efficient parallel applications. Until now, research in this area has mainly been focusing on homogeneous schemes. Howeve...