5100 search results - page 198 / 1020 » The Linear Complexity of a Graph |
ICDM
2005
IEEE
14 years 4 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
GD
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
IPL
2010
13 years 9 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...
DGCI
2006
Springer
14 years 2 months ago
2006
Springer
In this paper, we address the problem of vectorization of binary images on irregular isothetic grids. The representation of graphical elements by lines is common in document analys...
COCOON
2008
Springer
14 years 17 days ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...