5889 search results - page 229 / 1178 » Graph Layout Problems |
167
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
175
click to vote
JCO
2007
15 years 6 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
208
click to vote
IPL
2002
15 years 6 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
211
click to vote
DMTCS
2010
15 years 3 months ago
2010
A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...
196
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...