7 search results - page 2 / 2 » Heavy cycles in k-connected weighted graphs with large weigh... |
GD
2005
Springer
13 years 11 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
KDD
2012
ACM
11 years 8 months ago
2012
ACM
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...