@article{470cc0a652ad46f08cbfd3bd616b0495,
title = "Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs",
abstract = " This paper presents an O ( n log log n ) time algorithm for finding a depth-first search tree and an O ( n ) time algorithm for finding a breadth-first search tree in a permutation graph, respectively. ",
keywords = "Algorithms, Breadth-first search, Combinatorial problems, Depth-first search, Permutation graph",
author = "C. Rhee and Liang, {Y. Daniel} and Dhall, {S. K.} and S. Lakshmivarahan",
note = "This paper presents an O( n log log n) time algorithm for finding a depth-first search tree and an O( n) time algorithm for finding a breadth-first search tree in a permutation graph, respectively. View full text",
year = "1994",
month = jan,
day = "14",
doi = "10.1016/0020-0190(94)90053-1",
language = "American English",
volume = "44444444444",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier B.V.",
}