2314 search results - page 275 / 463 » Minimal Partitions of a Graph |
171
click to vote
ICS
1993
Tsinghua U.
15 years 8 months ago
1993
Tsinghua U.
Mapping data to parallel computers aims at minimizing the execution time of the associated application. However, it can take an unacceptable amount of time in comparison with the ...
147
click to vote
GD
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. As the number of devices connected to the internet continues to grow rapidly and software systems are being increasingly deployed on the web, security and privacy have be...
134
click to vote
PAMI
2010
15 years 2 months ago
2010
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
134
click to vote
GD
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we consider the problem of drawing a planar graph using circular arcs as edges, given a one-to-one mapping between the vertices of the graph and a set of points in t...
150
click to vote
DAM
2011
14 years 11 months ago
2011
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an ...