1664 search results - page 101 / 333 » Distance labeling in graphs |
141
click to vote
CJCDGCGT
2005
Springer
15 years 6 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
128
click to vote
SOCIALCOM
2010
15 years 2 months ago
2010
We introduce a novel technique for comparing graphs using the structure of their subgraphs, which we call a graph's fine structure. Our technique compares graphs using the ear...
118
click to vote
ICIP
2003
IEEE
16 years 6 months ago
2003
IEEE
We present a 3D brain MRI segmentation method in which a high resolution label image evolves under the influence of multiple constraints. The constraints are expressed in a versat...
138
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider the problem of clustering a collection of elements based on pairwise judgments of similarity and dissimilarity. Bansal, Blum and Chawla (in: Proceedings of 43rd FOCS, ...
126
click to vote
CCCG
2007
15 years 5 months ago
2007
We study the problem how to draw a planar graph such that every vertex is incident to an angle greater than π. In general a straightline embedding cannot guarantee this property....