618 search results - page 10 / 124 » Short cycle connectivity |
DM
2007
13 years 7 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
IEEEIAS
2009
IEEE
14 years 2 months ago
2009
IEEE
: A common technique hacker use is to route their traffic through a chain of stepping-stone hosts. It is generally agreed that there is no valid reason to use a long connection cha...
DM
2008
13 years 7 months ago
2008
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
DEXAW
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—In this work, we investigate the relative hardness of shorttext corpora in clustering problems and how this hardness relates to traditional similarity measures. Our appr...
CAAN
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we improve the quality of a recently suggested class of construction heuristics for the Asymmetric Traveling Salesman Problem (ATSP), namely the Contract-or-Patch heu...