Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs

C. Rhee, Y. Daniel Liang, S. K. Dhall, S. Lakshmivarahan

Research output: Contribution to journal › Article › peer-review

25 Scopus citations

Fingerprint

Dive into the research topics of 'Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs'. Together they form a unique fingerprint.

Mathematics