CPC
2006
13 years 4 months ago
2006
Let ;k g be the class of k-connected cubic graphs of girth at least g. For several choices of k and g, we determine a set Ok g of graph operations, for which, if G and H are graph...
DAGM
2006
Springer
13 years 8 months ago
2006
Springer
Existing methods for segmentation by edgel linking are based on heuristics and give no guarantee for a topologically correct result. In this paper, we propose an edgel linking algo...