Sciweavers

441 search results - page 45 / 89
» Convex Graph Invariants
Sort
View
COMPGEOM
2009
ACM
14 years 2 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...
GD
1998
Springer
13 years 12 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
ENDM
2008
142views more  ENDM 2008»
13 years 7 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
ICPR
2008
IEEE
14 years 2 months ago
Pattern vectors from the Ihara zeta function
This paper shows how to construct pattern vectors from the Ihara zeta function for the purposes of characterizing graph structures. To avoid the risk of sampling the meaningless i...
Peng Ren, Richard C. Wilson, Edwin R. Hancock
UAI
2004
13 years 9 months ago
On the Choice of Regions for Generalized Belief Propagation
Generalized belief propagation (GBP) has proven to be a promising technique for approximate inference tasks in AI and machine learning. However, the choice of a good set of cluste...
Max Welling