ICCV

2011

IEEE

12 years 10 months ago
2011

IEEE

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. ...

JCO

2011

13 years 4 months ago
2011

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...

TPDS

2010

13 years 8 months ago
2010

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...

SIAMDM

2010

13 years 8 months ago
2010

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...

IPL

2010

13 years 8 months ago
2010

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...

SIAMCOMP

2002

13 years 9 months ago
2002

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...

PRL

1998

13 years 9 months ago
1998

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...

COMBINATORICS

1999

13 years 9 months ago
1999

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

DM

2002

13 years 9 months ago
2002

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...

COMBINATORICA

2000

13 years 9 months ago
2000

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 ...