5889 search results - page 379 / 1178 » Graph Layout Problems |
161
click to vote
ESA
2004
Springer
16 years 6 days ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
204
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
176
click to vote
CCCG
2008
15 years 8 months ago
2008
We study the problem of computing Voronoi diagrams distributedly for a set of nodes of a network modeled as a Unit Disk Graph (UDG). We present an algorithm to solve this problem ...
150
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
170
click to vote
DAM
2008
15 years 6 months ago
2008
We study the combinatorial problem of finding an arrangement of distinct integers into the ddimensional N-cube so that the maximal variance of the numbers on each -dimensional sec...