257 search results - page 6 / 52 » The convexity spectra of graphs |
117
click to vote
DAM
2008
15 years 1 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
121
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
248
click to vote
GBRPR
2011
Springer
14 years 5 months ago
2011
Springer
Convexity represents an important principle of grouping in visual perceptual organization. This paper presents a new technique for contour grouping based on convexity and has the f...
99
Voted
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
104
Voted
DAM
2008
15 years 1 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...