Sciweavers

266 search results - page 8 / 54
» Graphs with Bounded Induced Distance
Sort
View
SIAMJO
2010
110views more  SIAMJO 2010»
14 years 6 months ago
Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinit
Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Hans D. Mittelmann, Jiming Peng
PAMI
2006
164views more  PAMI 2006»
14 years 11 months ago
A Binary Linear Programming Formulation of the Graph Edit Distance
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Derek Justice, Alfred O. Hero
EJC
2008
14 years 11 months ago
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities
We study restricted homomorphism dualities in the context of classes with bounded expansion. This presents a generalization of restricted dualities obtained earlier for bounded deg...
Jaroslav Nesetril, Patrice Ossona de Mendez
90
Voted
DM
2008
88views more  DM 2008»
14 years 11 months ago
Lower bounding the boundary of a graph in terms of its maximum or minimum degree
A vertex v of a graph G is a boundary vertex if there exists a vertex u such that the distance in G from u to v is at least the distance from u to any neighbour of v. We give the ...
Tobias Müller, Attila Pór, Jean-S&eacu...
CORR
2012
Springer
228views Education» more  CORR 2012»
13 years 7 months ago
Faster Approximate Distance Queries and Compact Routing in Sparse Graphs
A distance oracle is a compact representation of the shortest distance matrix of a graph. It can be queried to retrieve approximate distances and corresponding paths between any p...
Rachit Agarwal, Brighten Godfrey, Sariel Har-Peled