Sciweavers

3267 search results - page 92 / 654
» Generalized quasirandom graphs
Sort
View
ICDM
2007
IEEE
124views Data Mining» more  ICDM 2007»
15 years 5 months ago
Community Learning by Graph Approximation
Learning communities from a graph is an important problem in many domains. Different types of communities can be generalized as link-pattern based communities. In this paper, we p...
Bo Long, Xiaoyun Xu, Zhongfei (Mark) Zhang, Philip...
WADS
2007
Springer
106views Algorithms» more  WADS 2007»
15 years 5 months ago
Maximizing Maximal Angles for Plane Straight-Line Graphs
Let G = (S, E) be a plane straight-line graph on a finite point set S ⊂ R2 in general position. The incident angles of a point p ∈ S in G are the angles between any two edges ...
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, ...
INFOVIS
2002
IEEE
15 years 4 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
SSPR
2000
Springer
15 years 2 months ago
Prototype Learning with Attributed Relational Graphs
An algorithm for learning structural patterns given in terms of Attributed Relational Graphs (ARG's) is presented. The algorithm, based on inductive learning methodologies, pr...
Pasquale Foggia, Roberto Genna, Mario Vento
CATS
2006
15 years 18 days ago
Graph Orientation Algorithms to Minimize the Maximum Outdegree
We study the problem of orienting the edges of a weighted graph such that the maximum weighted outdegree of vertices is minimized. This problem, which has applications in the guar...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono, Kouhei ...