Journal of applied mathematics & informatics

  • 제5권2호
  • /
  • Pages.329-336
  • /
  • 1998
  • /
  • 2734-1194(pISSN)
  • /
  • 2234-8417(eISSN)
한국전산응용수학회 (The Korean Society for Computational and Applied Mathematics)
권호 표지

COMPUTATION OF A (CANONICAL) DOUBLY PERFECT ELIMINATION ORDERING OF A DOUBLY CHORDAL GRAPH

  • Lee, Mahn-Hoon (Computer Science Department Kangnung National University) ;
  • Kim, Chang-Hwa (Computer Science Department Kangnung National University)
  • 발행 : 1998.06.01

⟨ 이전 논문 다음 논문 ⟩

초록

The class of doubly chordal graphs is a subclass of chordal graphs and a superclass of strongly chordal graphs which arise in so many application areas. Many optimization problems like domination and Steiner tree are NP-complete on chordal graps but can be solved in polynomial time on doubly chordal graphs. The central to designing efficient algorithms for doulby chordal graphs is the concept of (canonical)doubly perfect elimination orderings. We present linear time algorithms to compute a (canonical) double perfect elimination ordering of a doubly chordal graph.

키워드

참고문헌

  1. J. Comput. Systems Sci. v.33 Chordality properties on graphs and minimal conceptual connections in semantic data models G.Ausiello;A.D'Atri;M.Moscarini
  2. J. ACM v.30 On the desirability of acyclic database schemes C.Beeri;R.Fagin;D.Maier;M.Yannakakis
  3. LNCS v.903 The algorithmic use of hypertree structure and maximum neighbourhood orderings A.Brandstadt;V.D.Chepoi;F.F.Dragan
  4. Disc.Math. v.9 A characterization of rigid circuit graphs P.Buneman
  5. Math. Programming v.22 Polynomially bounded algorithms for locating p-centers on a tree R.Chandrasekaran;A.Tamir
  6. Information Processing Letters v.29 On hypergraph acyclicity and graph chordality A.D'Atri;M.Moscarini
  7. J. Assoc. Comput. Mach. v.30 Degrees of acyclicity for hypergraphs and relational database schemes R.Fagin
  8. Algorithmic graph theory and perfect graphs M.C.Golumbic
  9. J. ACM v.30 Syntactic characterization of tree database schemes N.Goodman;O.Shmueli
  10. Cah. Cent. Etud. Rech. Oper. v.25 Duality in tree location theory A.W.J.Kolen
  11. J. Royal Statist. Soc., Ser. B v.50 Local computations with probabilities on graphical structures and their application to expert systems S.L.Lauritzen;D.J.Spiegelhalter
  12. Technical report, Ph.D. Thesis, School of Computer Science, Univ. of Oklahoma Algorithms and characterizations of special graphs in the chordal hierarchy. Mahnhoon Lee
  13. SIAM J. Comput. v.16 no.5 Doubly lexical orderings of matrices A.Lubiw
  14. Networks v.23 Doubly chordal graphs, steiner trees, and connected domination M.Moscarini
  15. SIAM J. Comput v.16 no.6 Three partition refinement algorithms R.Paige;R.E.Tarjan
  16. SIAM J. Comput v.8 Scheduling interval ordered tasks C.H.Papadimitriou;M.Yannakakis
  17. J. Math. Anal. and App. v.32 Triangulated graphs and the elimination process D.J.Rose
  18. SIAM J. Comput. v.5 Algorithmic aspects of vertex elimination on graphs D.J.Rose;R.E.Tarjan;G.S.Lucker
  19. Disc. Appl. Math. v.7 Some aspects of perfect elimination orderings in chordal graphs D.R.Shier
  20. IPL v.45 Doubly lexical ordering of dense 0-1 matrices J.P.Spinrad
  21. Technical Report CS 259, Maximum cardinality search and chordal graphs R.E.Tarjan
  22. SIAM J. Comput. v.13 no.3 Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs R.E.Tarjan;M.Yannakakis