Sciweavers

557 search results - page 79 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
PR
2007
81views more  PR 2007»
15 years 2 months ago
Graph embedding using tree edit-union
In this paper we address the problem of how to learn a structural prototype that can be used to represent the variations present in a set of trees. The prototype serves as a patte...
Andrea Torsello, Edwin R. Hancock
127
Voted
IJCNN
2007
IEEE
15 years 9 months ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
JEA
2008
88views more  JEA 2008»
15 years 3 months ago
Multilevel algorithms for linear ordering problems
Linear ordering problems are combinatorial optimization problems which deal with the minimization of different functionals in which the graph vertices are mapped onto (1, 2, ..., ...
Ilya Safro, Dorit Ron, Achi Brandt
JGAA
2006
72views more  JGAA 2006»
15 years 3 months ago
A Multilevel Algorithm for the Minimum 2-sum Problem
In this paper we introduce a direct motivation for solving the minimum 2-sum problem, for which we present a linear-time algorithm inspired by the Algebraic Multigrid approach whi...
Ilya Safro, Dorit Ron, Achi Brandt
149
Voted
SAGT
2010
Springer
202views Game Theory» more  SAGT 2010»
15 years 1 months ago
Computing Stable Outcomes in Hedonic Games
We study the computational complexity of finding stable outcomes in symmetric additively-separable hedonic games. These coalition formation games are specified by an undirected e...
Martin Gairing, Rahul Savani