Sciweavers

323 search results - page 32 / 65
» Dualizability and graph algebras
Sort
View
JGAA
2006
72views more  JGAA 2006»
13 years 7 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
IPPS
2006
IEEE
14 years 1 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
COMBINATORICS
2004
90views more  COMBINATORICS 2004»
13 years 7 months ago
Goldberg-Coxeter Construction for 3- and 4-valent Plane Graphs
We consider the Goldberg-Coxeter construction GCk,l(G0) (a generalization of a simplicial subdivision of the dodecahedron considered in [Gold37] and [Cox71]), which produces a pla...
Mathieu Dutour, Michel Deza
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 9 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster
CVPR
2005
IEEE
14 years 9 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas