참고문헌
- 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
- J. ACM v.30 On the desirability of acyclic database schemes C.Beeri;R.Fagin;D.Maier;M.Yannakakis
- LNCS v.903 The algorithmic use of hypertree structure and maximum neighbourhood orderings A.Brandstadt;V.D.Chepoi;F.F.Dragan
- Disc.Math. v.9 A characterization of rigid circuit graphs P.Buneman
- Math. Programming v.22 Polynomially bounded algorithms for locating p-centers on a tree R.Chandrasekaran;A.Tamir
- Information Processing Letters v.29 On hypergraph acyclicity and graph chordality A.D'Atri;M.Moscarini
- J. Assoc. Comput. Mach. v.30 Degrees of acyclicity for hypergraphs and relational database schemes R.Fagin
- Algorithmic graph theory and perfect graphs M.C.Golumbic
- J. ACM v.30 Syntactic characterization of tree database schemes N.Goodman;O.Shmueli
- Cah. Cent. Etud. Rech. Oper. v.25 Duality in tree location theory A.W.J.Kolen
- 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
- Technical report, Ph.D. Thesis, School of Computer Science, Univ. of Oklahoma Algorithms and characterizations of special graphs in the chordal hierarchy. Mahnhoon Lee
- SIAM J. Comput. v.16 no.5 Doubly lexical orderings of matrices A.Lubiw
- Networks v.23 Doubly chordal graphs, steiner trees, and connected domination M.Moscarini
- SIAM J. Comput v.16 no.6 Three partition refinement algorithms R.Paige;R.E.Tarjan
- SIAM J. Comput v.8 Scheduling interval ordered tasks C.H.Papadimitriou;M.Yannakakis
- J. Math. Anal. and App. v.32 Triangulated graphs and the elimination process D.J.Rose
- SIAM J. Comput. v.5 Algorithmic aspects of vertex elimination on graphs D.J.Rose;R.E.Tarjan;G.S.Lucker
- Disc. Appl. Math. v.7 Some aspects of perfect elimination orderings in chordal graphs D.R.Shier
- IPL v.45 Doubly lexical ordering of dense 0-1 matrices J.P.Spinrad
- Technical Report CS 259, Maximum cardinality search and chordal graphs R.E.Tarjan
- 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