Sciweavers

441 search results - page 28 / 89
» Convex Graph Invariants
Sort
View
CPC
2010
103views more  CPC 2010»
14 years 12 months ago
Duality of Ends
We investigate the end spaces of infinite dual graphs. We show that there exists a natural homeomorphism between the end spaces of a graph and its dual, and that this homeomorphis...
Henning Bruhn, Maya Jakobine Stein
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
14 years 12 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
ICML
2010
IEEE
15 years 25 days ago
Fast Neighborhood Subgraph Pairwise Distance Kernel
We introduce a novel graph kernel called the Neighborhood Subgraph Pairwise Distance Kernel. The kernel decomposes a graph into all pairs of neighborhood subgraphs of small radius...
Fabrizio Costa, Kurt De Grave
109
Voted
SODA
2008
ACM
93views Algorithms» more  SODA 2008»
15 years 1 months ago
Minimum weight convex Steiner partitions
New tight bounds are presented on the minimum length of planar straight line graphs connecting n given points in the plane and having convex faces. Specifically, we show that the ...
Adrian Dumitrescu, Csaba D. Tóth
IVC
2007
114views more  IVC 2007»
14 years 11 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...