36 search results - page 2 / 8 » On cycles through specified vertices |
TALG
2010
13 years 21 min 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
2010
13 years 3 months ago
2010
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
GLVLSI
2003
IEEE
13 years 10 months ago
2003
IEEE
The current trends in high performance integrated circuits are towards faster and more powerful circuits in the giga-hertz range and even further. As the more complex Integrated C...
DM
2008
13 years 5 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— – Major research challenges in the next generation of wireless networks include the provisioning of worldwide seamless mobility across heterogeneous wireless networks, the im...