1485 search results - page 11 / 297 » connection 2010 |
ENDM
2002
13 years 7 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
CCCG
2010
13 years 9 months ago
2010
The cluster connecting problem inside a simple polygon is introduced in this paper. The problem is shown to be NP-complete. A log n-factor approximation algorithm is proposed.
IJNM
2010
13 years 6 months ago
2010
IWPC
2010
IEEE
13 years 6 months ago
2010
IEEE
MCS
2010
Springer
13 years 6 months ago
2010
Springer