1664 search results - page 96 / 333 » Distance labeling in graphs |
123
click to vote
COMBINATORICS
2006
15 years 4 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
117
click to vote
ECEASST
2010
15 years 1 months ago
2010
In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, ...
126
click to vote
WDAG
1998
Springer
15 years 8 months ago
1998
Springer
Sense of direction is a property of labeled graphs which has been shown to have a de
147
click to vote
SIAMJO
2010
14 years 11 months ago
2010
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 ...
161
click to vote
ECCV
2002
Springer
16 years 6 months ago
2002
Springer
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...