2503 search results - page 66 / 501 » A study of 3-arc graphs |
164
click to vote
PPAM
2007
Springer
16 years 1 days ago
2007
Springer
Abstract. The paper describes an application of Parallel Simulated Annealing (PSA) for solving one of the most studied NP-hard optimization problems: Graph Coloring Problem (GCP). ...
153
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
124
click to vote
COMBINATORICA
2010
15 years 3 months ago
2010
For finite sets of integers A1, A2 . . . An we study the cardinality of the n-fold sumset A1 +
291
click to vote
ICDE
2005
IEEE
16 years 7 months ago
2005
IEEE
A reverse nearest neighbor (RNN) query returns the data objects that have a query point as their nearest neighbor (NN). Although such queries have been studied quite extensively in...
146
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
The vast majority of earlier work has focused on graphs which are both connected (typically by ignoring all but the giant connected component), and unweighted. Here we study numer...