| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438578 | Theoretical Computer Science | 2007 | 10 Pages |
Abstract
We obtain a polynomial algorithm in O(nm) time to find a long path in any graph with n vertices and m edges. The length of the path is bounded by a parameter defined on neighborhood condition of any three independent vertices of the path. An example is given to show that this bound is better than several classic results.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
