A polynomial-time algorithm for finding regular simple paths in outerplanar graphs

Authors:
Zhivko P. Nedev;Peter T. Wood
Affiliations:
-;-
Venue:
Journal of Algorithms
Year:
2000

Citing 0
Cited 2

A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs

Information Processing Letters
A trichotomy for regular simple path queries on graphs

Proceedings of the 32nd symposium on Principles of database systems

Quantified Score

Hi-index	0.00

Visualization

Abstract