646 search results - page 21 / 130 » Generalized connected domination in graphs |
ICDAR
2003
IEEE
14 years 1 months ago
2003
IEEE
A new system is presented for general symbol segmentation, which is applicable for segmentation of any connected string of symbols, including characters and line diagrams. Using a...
27
Voted
DM
2007
13 years 8 months ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
In recent years, there has been a prevalence of search engines being employed to find useful information in the Web as they efficiently explore hyperlinks between web pages which ...
JGT
2010
13 years 7 months ago
2010
: A well-known result of Tutte states that a 3-connected graph G is planar if and only if every edge of G is contained in exactly two induced non-separating circuits. Bixby and Cun...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...