Skip to main navigation Skip to search Skip to main content

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

  • Eastern Kentucky University
  • Indiana Purdue Univ at Fort Wayne
  • University of Oklahoma

Research output: Contribution to journalArticlepeer-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.
Sort by

Mathematics