1115 search results - page 10 / 223 » Separating Shape Graphs |
ACSC
2005
IEEE
14 years 29 days ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
TALG
2010
13 years 2 months ago
2010
We give a polynomial-time algorithm to find a shortest contractible cycle (i.e. a closed walk without repeated vertices) in a graph embedded in a surface. This answers a question ...
JCT
2007
13 years 7 months ago
2007
We prove results on the size of weakly and strongly separating set systems and matrices, and on cross-intersecting systems. As a consequence, we improve on a result of Katona and ...
ICCV
1999
IEEE
14 years 9 months ago
1999
IEEE
In human perception, convex surfaces have a strong tendency to be perceived as the "figure". Convexity has a stronger influence on figural organization than other global...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...