Abstract
The maximal path problem is the following: Given a graph G = (V, E) and a vertex r, find a path starting at r that cannot be extended without encountering a node that is already on the path. We shall show that if all nodes have degree at most D(n), the problem can be solved in O(D(n) log 3 n) time using O(n 2) processors. We also obtain an NC algorithm for the maximal path problem in planar graphs. Finally, we show that the problem of computing the lexicographically minimal maximal path is P-complete, even when restricted to planar graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.