Sciweavers

1550 search results - page 114 / 310
» Benchmarking for Graph Transformation
Sort
View
IJRR
2006
116views more  IJRR 2006»
15 years 3 months ago
The Graph SLAM Algorithm with Applications to Large-Scale Mapping of Urban Structures
This article presents GraphSLAM, a unifying algorithm for the offline SLAM problem. GraphSLAM is closely related to a recent sequence of research papers on applying optimization t...
Sebastian Thrun, Michael Montemerlo
TIP
2008
99views more  TIP 2008»
15 years 3 months ago
Using Spanning Graphs for Efficient Image Registration
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...
Mert R. Sabuncu, Peter J. Ramadge
121
Voted
COMGEO
2004
ACM
15 years 3 months ago
How to draw the minimum cuts of a planar graph
We show how to utilize the cactus representation of all minimum cuts of a graph to visualize the minimum cuts of a planar graph in a planar drawing. In a first approach the cactus...
Ulrik Brandes, Sabine Cornelsen, Christian Fie&szl...
SLS
2007
Springer
117views Algorithms» more  SLS 2007»
15 years 9 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
103
Voted
GD
2009
Springer
15 years 8 months ago
Upward Planarization Layout
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...