The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
ACM Computing Classification System (1998): G.2.2.
We propose an algorithm that computes the length of a longest
path in a cactus graph. Our algorithm can easily be modified to output a
longest path as well or to solve the problem on cacti with edge or vertex
weights. The algorithm works on rooted cacti and assigns to each vertex
a two-number label, the first number being the desired parameter of the
subcactus rooted at that vertex. The algorithm applies the divide-and-conquer approach...
Download Results (CSV)