In Simultaneous Localisation and Mapping (SLAM) the correspondence problem, specifically detecting cycles, is one of the most difficult challenges for an autonomous mobile robot. ...
Margaret E. Jefferies, Michael C. Cosgrove, Jesse ...
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...
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...
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...
— 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...
Md. Kamrul Hasan, Mohammad Kaykobad, Young-Koo Lee...