@inproceedings{77f93edf903e48aa83cad0da47098067,
title = "NC algorithms for finding depth-first-search trees in interval graphs and circular-arc graphs",
abstract = "Finding depth-first-search (DFS) trees of graphs is one of the fundamental problems in graph theory which has many practical applications. However, there exists no NC parallel algorithm for this problem in general graphs. NC parallel algorithms for finding DFS trees for the interval graphics and circular-arc graphs are presented. These algorithms take O(log n) time using κn processors on the EREW model, where κ is the number of cliques in a graph of n nodes.",
author = "Y. Liang and C. Rhee and Dhall, {S. K.} and S. Lakshmivarahan",
year = "1991",
language = "English",
isbn = "0780300335",
series = "Conference Proceedings - IEEE SOUTHEASTCON",
publisher = "Publ by IEEE",
pages = "582--585",
booktitle = "Conference Proceedings - IEEE SOUTHEASTCON",
note = "IEEE Proceedings of the SOUTHEASTCON '91 ; Conference date: 08-04-1991 Through 10-04-1991",
}