EFFICIENT ALGORITHMS FOR FINDING DEPTH-FIRST AND BREADTH-FIRST SEARCH-TREES IN PERMUTATION GRAPHS

Authors
RHEE C LIANG YD DHALL SK LAKSHMIVARAHAN S
Citation
C. Rhee et al., EFFICIENT ALGORITHMS FOR FINDING DEPTH-FIRST AND BREADTH-FIRST SEARCH-TREES IN PERMUTATION GRAPHS, Information processing letters, 49(1), 1994, pp. 45-50
Citations number
3
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
49
Issue
1
Year of publication
1994
Pages
45 - 50
Database
ISI
SICI code
0020-0190(1994)49:1<45:EAFFDA>2.0.ZU;2-Q
Abstract
This paper presents an O(n log log n) time algorithm for finding a dep th-first search tree and an O(n) time algorithm for finding a breadth- first search tree in a permutation graph, respectively.