Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs

Authors:
C. Rhee;Y. Daniel Liang;S. K. Dhall;S. Lakshmivarahan
Affiliations:
-;-;-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 3

An optimal algorithm for finding biconnected components in permutation graphs

CSC '95 Proceedings of the 1995 ACM 23rd annual conference on Computer science
Unrestricted and complete Breadth-First Search of trapezoid graphs in O(n) time

Information Processing Letters
Localized and compact data-structure for comparability graphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

Quantified Score

Hi-index	0.89

Visualization

Abstract