1422 search results - page 1 / 285 » The geometry of graphs and some of its algorithmic applicati... |
FOCS
1994
IEEE
13 years 11 months ago
1994
IEEE
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
JGAA
2000
13 years 7 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
ER
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We present a new technique for discovering and representing structural changes between two versions of a directed acyclic graph (DAG). Motivated by the necessity of chang...
COMPGEOM
2005
ACM
13 years 9 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...