3267 search results - page 168 / 654 » Generalized quasirandom graphs |
194
click to vote
ICALP
1992
Springer
15 years 10 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...
157
click to vote
ICFEM
2000
Springer
15 years 10 months ago
2000
Springer
A family of well known problems on graphs includingthe shortest path problem and the data flow analysis problem can be uniformly formulated as a fixed-point problem on graphs. We ...
155
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
168
click to vote
ENDM
2008
15 years 6 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...
193
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...