warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
11 years 3 months ago
Double Window Optimisation for Constant Time Visual SLAM
We present a novel and general optimisation framework for visual SLAM, which scales for both local, highly accurate reconstruction and large-scale motion with long loop closures. ...
Hauke Strasdat, Andrew J. Davison, J. M. M. Montie...
113views more  JCO 2011»
11 years 10 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
109views more  TPDS 2010»
12 years 1 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
128views more  SIAMDM 2010»
12 years 2 months ago
t-Perfection Is Always Strong for Claw-Free Graphs
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
Henning Bruhn, Maya Stein
160views more  IPL 2010»
12 years 2 months ago
Antimagic labeling and canonical decomposition of graphs
An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1, . . . , m} to the edges such that the sums of incident labels are distinct at...
Michael D. Barrus
113views more  SIAMCOMP 2002»
12 years 3 months ago
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
Joachim Gudmundsson, Christos Levcopoulos, Giri Na...
91views more  PRL 1998»
12 years 3 months ago
Genetic operators for hierarchical graph clustering
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
Stefano Rizzi
95views more  COMBINATORICS 1999»
12 years 3 months ago
Maximum Degree Growth of the Iterated Line Graph
Let k denote the maximum degree of the kth iterated line graph Lk(G). For any connected graph G that is not a path, the inequality k+1 2k - 2 holds. Niepel, Knor, and Solt
Stephen G. Hartke, Aparna W. Higgins
88views more  DM 2002»
12 years 3 months ago
Tutte polynomial expansions for 2-separable graphs
Let ^G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the...
Douglas R. Woodall
105views more  COMBINATORICA 2000»
12 years 3 months ago
On Cayley Graphs on the Symmetric Group Generated by Tranpositions
Given a connected graph, X, we denote by 2 = 2(X) its smallest non-zero Laplacian eigenvalue. In this paper we show that among all sets of n - 1 transpositions which generate the ...
Joel Friedman