95 search results - page 3 / 19 » Finding one tight cycle |
KES
2004
Springer
14 years 1 months ago
2004
Springer
In Simultaneous Localisation and Mapping (SLAM) the correspondence problem, specifically detecting cycles, is one of the most difficult challenges for an autonomous mobile robot. ...
SPAA
1993
ACM
14 years 18 days ago
1993
ACM
We give tight bounds on the parallel complexity of some problems involving random graphs. Speci cally, we show that a Hamiltonian cycle, a breadth rst spanning tree, and a maximal...
RECOMB
2008
Springer
14 years 8 months ago
2008
Springer
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
ICRE
1998
IEEE
14 years 24 days ago
1998
IEEE
Systems requirements errors are numerous, persistent, and expensive. To detect such errors, and focus on critical ones during the development of a requirements document, we have d...
TCS
2010
13 years 7 months ago
2010
— Rahman and Kaykobad introduced a shortest distance based condition for finding the existence of Hamiltonian paths in graphs as follows: Let G be a connected graph with n vertic...