An algorithm for the detection of the longest path between any two vertices of a graph was proposed. The method was used to calculate the detour index of fused bicyclic structures. Analytical formulas for the detour index of fused bicyclic structures were derived, and it was shown the these can only be third-order polynomials.
|Number of pages||4|
|Journal||Journal of Chemical Information and Computer Sciences|
|Publication status||Published - Jan 1 1997|
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics