3267 search results - page 126 / 654 » Generalized quasirandom graphs |
140
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
In this paper we present an O(n log n) algorithm for finding a maximum flow in a directed planar graph, where the vertices are subject to capacity constraints, in addition to the...
119
click to vote
ACSC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
140
click to vote
CAAN
2007
Springer
15 years 10 months ago
2007
Springer
In the recently introduced model for cleaning a graph with brushes, we use a degree-greedy algorithm to clean a random d-regular graph on n vertices (with dn even). We then use a d...
153
click to vote
AE
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
200
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...