This old project implements algorithms described in the following paper to determine whether a given graph is an interval graph: Lex-BFS and Partition Refinement, with Applications to Transitive ...
Abstract: To solve connected dominating problem, it is necessary to find minimum connected dominating set (MCDS for short). However, to find MCDS is NP-hardness. So, a model of graphs called interval ...
Abstract: This paper focuses on developing a performance guaranteed state estimation algorithm for 2D pose graph problems for mobile robots. Different from probabilistic methods, the measurement ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback