Journal of applied mathematics & informatics

The Korean Society for Computational and Applied Mathematics (한국전산응용수학회)
권호 표지

AN OPTIMAL ALGORITHM FOR FINDING DETH-FIRST SPANNING TREE ON PERMUTATION GRAPHS

  • Mondal, Sukumar (Department of Mathematics with Oceanology and Computer Programming Vidyasagar University) ;
  • Pal, Madhumangal (Department of Mathematics Midnapore College) ;
  • Pal, Tapan K. (Department of Mathematics with Oceanology and Computer Programming Vidyasagar University)
  • Published : 1999.09.01

⟨ Previous Next ⟩

Abstract

Let G be a connected graph of n vertices. The problem of finding a depth-first spanning tree of G is to find a connected subgraph of G with the n vertices and n-1 edges by depth-first-search. in this paper we propose an O(n) time algorithm to solve this problem on permutation graphs.

Keywords

References

  1. J. ACM v.19 Permutation graphs and transitive graphs eve72 Even.S.;Pnnueli.A.;Lempel.A.
  2. Canad. J. Math. v.23 Transitive orientation of graphs and identification of permutation graphs eve71 Even.S.;Pnnueli.A.;Lempel.A.
  3. Algorithmic graph theory and perfect graphs go180 Golumbic.M.C.
  4. J. Graph Theory v.19 On the existence of special depth first search trees kor95 Korach.E.;Ostfeld.Z.
  5. 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
  6. 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
  7. 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.
  8. Information Processing Letters v.29 A linear-processor algorithm for depth first search in planar graphs sha88 Shannon.G.E.
  9. Information Processing Letters v.32 An efficient distributed depth first search algorithm sha89 Sharma.M.B.;Iyengar.S.S.;Mandyam.N.K.
  10. SIAM J. Comput. v.1 Depth-first search and linear graph algorithms tar72 Tarjan.R.E.