@incollection{ Blair1993,
  abstract = {Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations},
  author = {Blair, JRS and Peyton, B},
  booktitle = {Graph theory and sparse matrix computation, The IMA Volumes in Mathematics and its Applications},
  doi = {10.1007/978-1-4613-8369-7_1},
  editor = {{Alan George} and Gilbert, John R. and Liu, Joseph W. H.},
  file = {:home/anhduc/Desktop/Dropbox/Mendeley Desktop/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf:pdf},
  keywords = {Cholesky factorization,Prim’s algorithm,acyclic hypergraphs,chordal graphs,clique trees,maximum cardinality search,minimum spanning tree,sparse linear systems},
  pages = {1--29},
  publisher = {Springer New York},
  title = {{An introduction to chordal graphs and clique trees}},
  url = {https://www.dropbox.com/sh/v4blv7sito3opzn/AABnVyqE0T3mzFu6q0aELZVAa/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf?dl=0},
  year = {1993}
}

{"_id":"uFdeEMyAris34kBSH","bibbaseid":"blair-peyton-anintroductiontochordalgraphsandcliquetrees-1993","downloads":0,"creationDate":"2015-06-13T03:15:11.766Z","title":"An introduction to chordal graphs and clique trees","author_short":["Blair, J.","Peyton, B"],"year":1993,"bibtype":"incollection","biburl":"https://dl.dropboxusercontent.com/u/9343921/library.bib","bibdata":{"abstract":"Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations","author":["Blair, JRS","Peyton, B"],"author_short":["Blair, J.","Peyton, B"],"bibtex":"@incollection{ Blair1993,\n abstract = {Clique trees and chordal graphs have carved out a niche for themselves in recent work on sparse matrix algorithms, due primarily to research questions associated with advanced computer architectures. This paper is a unified and elementary introduction to the standard characterizations of chordal graphs and clique trees. The pace is leisurely, as detailed proofs of all results are included. We also briefly discuss applications of chordal graphs and clique trees in sparse matrix computations},\n author = {Blair, JRS and Peyton, B},\n booktitle = {Graph theory and sparse matrix computation, The IMA Volumes in Mathematics and its Applications},\n doi = {10.1007/978-1-4613-8369-7_1},\n editor = {{Alan George} and Gilbert, John R. and Liu, Joseph W. H.},\n file = {:home/anhduc/Desktop/Dropbox/Mendeley Desktop/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf:pdf},\n keywords = {Cholesky factorization,Prim’s algorithm,acyclic hypergraphs,chordal graphs,clique trees,maximum cardinality search,minimum spanning tree,sparse linear systems},\n pages = {1--29},\n publisher = {Springer New York},\n title = {{An introduction to chordal graphs and clique trees}},\n url = {https://www.dropbox.com/sh/v4blv7sito3opzn/AABnVyqE0T3mzFu6q0aELZVAa/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf?dl=0},\n year = {1993}\n}","bibtype":"incollection","booktitle":"Graph theory and sparse matrix computation, The IMA Volumes in Mathematics and its Applications","doi":"10.1007/978-1-4613-8369-7_1","editor":["Alan George","Gilbert, John R.","Liu, Joseph W. H."],"editor_short":["Alan George","Gilbert, J.<nbsp>R.","Liu, J.<nbsp>W.<nbsp>H."],"file":":home/anhduc/Desktop/Dropbox/Mendeley Desktop/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf:pdf","id":"Blair1993","key":"Blair1993","keywords":"Cholesky factorization,Prim’s algorithm,acyclic hypergraphs,chordal graphs,clique trees,maximum cardinality search,minimum spanning tree,sparse linear systems","pages":"1--29","publisher":"Springer New York","title":"An introduction to chordal graphs and clique trees","type":"incollection","url":"https://www.dropbox.com/sh/v4blv7sito3opzn/AABnVyqE0T3mzFu6q0aELZVAa/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf?dl=0","year":"1993","bibbaseid":"blair-peyton-anintroductiontochordalgraphsandcliquetrees-1993","role":"author","urls":{"Paper":"https://www.dropbox.com/sh/v4blv7sito3opzn/AABnVyqE0T3mzFu6q0aELZVAa/An introduction to chordal graphs and clique trees - Blair, Peyton - 1993.pdf?dl=0"},"keyword":["Cholesky factorization","Prim’s algorithm","acyclic hypergraphs","chordal graphs","clique trees","maximum cardinality search","minimum spanning tree","sparse linear systems"],"downloads":0},"search_terms":["introduction","chordal","graphs","clique","trees","blair","peyton"],"keywords":["cholesky factorization","prim’s algorithm","acyclic hypergraphs","chordal graphs","clique trees","maximum cardinality search","minimum spanning tree","sparse linear systems"],"authorIDs":[],"dataSources":["DJNCDySdY8tyWWhKE"]}