We present constant-work-space polynomial time algorithms for solving the shortest path problem, finding the chromatic polynomial, clique number, number of components, circumference, and girth of cactus graphs and blo...
详细信息
We present constant-work-space polynomial time algorithms for solving the shortest path problem, finding the chromatic polynomial, clique number, number of components, circumference, and girth of cactus graphs and block graphs. For some of these problems we also present in-place algorithms, which perform faster than the corresponding constantwork-spacealgorithms. The problems considered are fundamental to many areas of graph theory, computational geometry, and combinatorial optimization, and have a wide range of applications including transportation, robotics, and image processing. (C) 2015 Elsevier B.V. All rights reserved.
The shortest path problem is fundamental to many areas of image processing, and we present ways to solve it in environments where computation space is scarce. We propose two constant-work-space algorithms for solving ...
详细信息
ISBN:
(纸本)9783642419133;9783642419140
The shortest path problem is fundamental to many areas of image processing, and we present ways to solve it in environments where computation space is scarce. We propose two constant-work-space algorithms for solving the shortest path problem for cactus graphs and clique-cactus graphs of arbitrary size;both algorithms perform in polynomial time. We also present an in-place algorithm for finding the shortest path in cactus graphs, which performs in polynomial time of lower degree.
暂无评论