Results 1  10
of
110
Generic FactorBased Node Marginalization and Edge Sparsification for PoseGraph SLAM
"... Abstract—This paper reports on a factorbased method for node marginalization in simultaneous localization and mapping (SLAM) posegraphs. Node marginalization in a posegraph induces fillin and leads to computational challenges in performing inference. The proposed method is able to produce a new ..."
Abstract

Cited by 11 (6 self)
 Add to MetaCart
Abstract—This paper reports on a factorbased method for node marginalization in simultaneous localization and mapping (SLAM) posegraphs. Node marginalization in a posegraph induces fillin and leads to computational challenges in performing inference. The proposed method is able to produce a new
An improved bound on the largest induced forests for trianglefree planar graphs
"... We proved that every planar trianglefree graph of order n has a subset of vertices that induces a forest of size at least (71n+72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We proved that every planar trianglefree graph of order n has a subset of vertices that induces a forest of size at least (71n+72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth.
An improved bound on the largest induced forrests for trianglefree planar graphs
, 2009
"... We proved that every planar trianglefree graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth. ..."
Abstract
 Add to MetaCart
We proved that every planar trianglefree graph with n vertices has a subset of vertices that induces a forest of size at least (71n + 72)/128. This improves the earlier work of Salavatipour [10]. We also pose some questions regarding planar graphs of higher girth.
Equivalence of Local Treewidth and Linear Local Treewidth and its Algorithmic Applications
 In Proceedings of the 15th ACMSIAM Symposium on Discrete Algorithms (SODA’04
, 2003
"... We solve an open problem posed by Eppstein in 1995 [14, 15] and reenforced by Grohe [16, 17] concerning locally bounded treewidth in minorclosed families of graphs. A graph has bounded local treewidth if the subgraph induced by vertices within distance r of any vertex has treewidth bounded by a f ..."
Abstract

Cited by 31 (10 self)
 Add to MetaCart
We solve an open problem posed by Eppstein in 1995 [14, 15] and reenforced by Grohe [16, 17] concerning locally bounded treewidth in minorclosed families of graphs. A graph has bounded local treewidth if the subgraph induced by vertices within distance r of any vertex has treewidth bounded by a
LARGE NEARLY REGULAR INDUCED SUBGRAPHS
, 2008
"... For a real c ≥ 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in particular, every graph on n vertices contains a regular i ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
For a real c ≥ 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the maximum degree is at most c times the minimum degree. Thus, in particular, every graph on n vertices contains a regular
Disambiguating visual relations using loop constraints
 In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition
, 2010
"... Repetitive and ambiguous visual structures in general pose a severe problem in many computer vision applications. Identification of incorrect geometric relations between images solely based on low level features is not always possible, and a more global reasoning approach about the consistency of ..."
Abstract

Cited by 35 (7 self)
 Add to MetaCart
of the estimated relations is required. We propose to utilize the typically observed redundancy in the hypothesized relations for such reasoning, and focus on the graph structure induced by those relations. Chaining the (reversible) transformations over cycles in this graph allows to build suitable statistics
When is a Poset Isomorphic to the Poset of Connected Induced Subgraphs of a Graph?
 Southwest J. Pure Appl. Math
, 1996
"... Suppose G is a finite connected graph. Let C(G) denote the inclusion ordering on the connected vertexinduced subgraphs of G. Resolving a problem posed by Steve Steinsaltz, we characterize posets that arise in this way. In particular, we show that, for a finite poset P, there exists a finite graph ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Suppose G is a finite connected graph. Let C(G) denote the inclusion ordering on the connected vertexinduced subgraphs of G. Resolving a problem posed by Steve Steinsaltz, we characterize posets that arise in this way. In particular, we show that, for a finite poset P, there exists a finite graph
On WingPerfect Graphs
, 1997
"... An edge in a graph G is called a wing if it is one of the two nonincident edges of an induced P 4 (a path on four vertices) in G. For a graph G its winggraph W (G) is defined as the graph whose vertices are the wings of G and two vertices in W (G) are connected if the corresponding wings in G be ..."
Abstract
 Add to MetaCart
An edge in a graph G is called a wing if it is one of the two nonincident edges of an induced P 4 (a path on four vertices) in G. For a graph G its winggraph W (G) is defined as the graph whose vertices are the wings of G and two vertices in W (G) are connected if the corresponding wings in G
A multifrontal QR factorization approach to distributed inference applied to multirobot localization and mapping
 AAAI National Conference on Artificial Intelligence
, 2005
"... QR factorization is most often used as a black box algorithm, but is in fact an elegant computation on a factor graph. By computing a rooted clique tree on this graph, the computation can be parallelized across subtrees, which forms the basis of socalled multifrontal QR methods. By judiciously c ..."
Abstract

Cited by 20 (7 self)
 Add to MetaCart
lem as inference on a largescale Gaussian Markov Random Field induced by the measurement factor graph, and show how multifrontal QR on this graph solves for the global map and all the robot poses in a distributed fashion. The method is illustrated using both small and largescale simulations, and validated
The intrinsic dimensionality of graphs
 IN STOC
, 2003
"... We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [16]. For a graph G, let dim(G) be the smallest d such that G occurs as a (not necessarily induced) subgraph of Z d ∞, the infinite graph with vertex set Z d and an edge (u, v) whenever u − v ∞ = 1. ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [16]. For a graph G, let dim(G) be the smallest d such that G occurs as a (not necessarily induced) subgraph of Z d ∞, the infinite graph with vertex set Z d and an edge (u, v) whenever u − v ∞ = 1
Results 1  10
of
110