557 search results - page 15 / 112 » Visualizing Weighted Edges in Graphs |
118
click to vote
COMGEO
2004
ACM
15 years 10 days ago
2004
ACM
Let n point sites be situated on the vertices or edges of a geometric graph G over e edges. Each site can be assigned a multiplicative weight and a color. We discuss the complexit...
120
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
112
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
105
click to vote
IPL
2008
15 years 14 days ago
2008
Let S be a set of n points in general position in the plane, labelled bijectively with the integers {0, 1, . . ., n - 1}. Each edge (the straight segment that joins two points) is...
102
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
A new approach for selective edge enhancement using unsharp masking is presented. This is based on the premise that biological vision and image reproduction share common principle...