References
- J. ACM v.19 Permutation graphs and transitive graphs eve72 Even.S.;Pnnueli.A.;Lempel.A.
- Canad. J. Math. v.23 Transitive orientation of graphs and identification of permutation graphs eve71 Even.S.;Pnnueli.A.;Lempel.A.
- Algorithmic graph theory and perfect graphs go180 Golumbic.M.C.
- J. Graph Theory v.19 On the existence of special depth first search trees kor95 Korach.E.;Ostfeld.Z.
- IEEE Proc. SOUTH-EASTCON '91 v.1 NC algorithms for finding depth first search trees in tinterval graphs and circular-arc graphs lia91 Liang.Y.;Rhee.C.;Dhall.S.K.;Lakshmivarahan
- Information Proceesing Letters v.49 Efficient algorithms for finding depth-first and breadth-first search trees permutation graphs rhe94 Rhee.C.;Liang.Y.;Dhall.S.K.;Lakshmivarahan
- Internat. J. Comput. Math. v.57 A new algorithm for minimum spanning tree using depth-first search in an undirected graph sal95 Salehi-Fathabadi.H.;Ahrabian.H.
- Information Processing Letters v.29 A linear-processor algorithm for depth first search in planar graphs sha88 Shannon.G.E.
- Information Processing Letters v.32 An efficient distributed depth first search algorithm sha89 Sharma.M.B.;Iyengar.S.S.;Mandyam.N.K.
- SIAM J. Comput. v.1 Depth-first search and linear graph algorithms tar72 Tarjan.R.E.