361 search results - page 10 / 73 » Relaxed Gabriel Graphs |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In the k-edge-connected spanning subgraph problem we are given a graph (V, E) and costs for each edge, and want to find a minimum-cost F E such that (V, F) is k-edge-connected. I...
RELMICS
2000
Springer
13 years 11 months ago
2000
Springer
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
SIAMJO
2008
13 years 7 months ago
2008
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
DM
2011
12 years 11 months ago
2011
We show that regular median graphs of linear growth are the Cartesian product of finite hypercubes with the two-way infinite path. Such graphs are Cayley graphs and have only tw...
JMLR
2010
13 years 2 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...