@article{ Chandran2003,
  abstract = {We develop a constant time transposition “oracle” for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the initialization of the algorithm can be performed in linear time. We also develop two new characterizations of perfect elimination orderings: one in terms of chordless paths, and the other in terms of minimal u-v separators.},
  author = {Chandran, L.S. and Ibarra, L. and Ruskey, F. and Sawada, J.},
  doi = {10.1016/S0304-3975(03)00221-4},
  file = {:Users/KunihiroWASA/Dropbox/paper/2003/Chandran et al., Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph, 2003.pdf:pdf},
  issn = {03043975},
  journal = {Theoretical Computer Science},
  keywords = {2-Processor scheduling,Antimatroid,Chordal graph,Clique tree,Gray code,Perfect elimination ordering},
  month = {October},
  number = {2},
  pages = {303--317},
  title = {{Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph}},
  url = {http://www.sciencedirect.com/science/article/pii/S0304397503002214 http://linkinghub.elsevier.com/retrieve/pii/S0304397503002214},
  volume = {307},
  year = {2003}
}

{"_id":"BGLRz76xgXv9bAMWE","authorIDs":[],"author_short":["Chandran, L.","Ibarra, L.","Ruskey, F.","Sawada, J."],"bibbaseid":"chandran-ibarra-ruskey-sawada-generatingandcharacterizingtheperfecteliminationorderingsofachordalgraph-2003","bibdata":{"abstract":"We develop a constant time transposition “oracle” for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the initialization of the algorithm can be performed in linear time. We also develop two new characterizations of perfect elimination orderings: one in terms of chordless paths, and the other in terms of minimal u-v separators.","author":["Chandran, L.S.","Ibarra, L.","Ruskey, F.","Sawada, J."],"author_short":["Chandran, L.","Ibarra, L.","Ruskey, F.","Sawada, J."],"bibtex":"@article{ Chandran2003,\n abstract = {We develop a constant time transposition “oracle” for the set of perfect elimination orderings of chordal graphs. Using this oracle, we can generate a Gray code of all perfect elimination orderings in constant amortized time using known results about antimatroids. Using clique trees, we show how the initialization of the algorithm can be performed in linear time. We also develop two new characterizations of perfect elimination orderings: one in terms of chordless paths, and the other in terms of minimal u-v separators.},\n author = {Chandran, L.S. and Ibarra, L. and Ruskey, F. and Sawada, J.},\n doi = {10.1016/S0304-3975(03)00221-4},\n file = {:Users/KunihiroWASA/Dropbox/paper/2003/Chandran et al., Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph, 2003.pdf:pdf},\n issn = {03043975},\n journal = {Theoretical Computer Science},\n keywords = {2-Processor scheduling,Antimatroid,Chordal graph,Clique tree,Gray code,Perfect elimination ordering},\n month = {October},\n number = {2},\n pages = {303--317},\n title = {{Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph}},\n url = {http://www.sciencedirect.com/science/article/pii/S0304397503002214 http://linkinghub.elsevier.com/retrieve/pii/S0304397503002214},\n volume = {307},\n year = {2003}\n}","bibtype":"article","doi":"10.1016/S0304-3975(03)00221-4","file":":Users/KunihiroWASA/Dropbox/paper/2003/Chandran et al., Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph, 2003.pdf:pdf","id":"Chandran2003","issn":"03043975","journal":"Theoretical Computer Science","key":"Chandran2003","keywords":"2-Processor scheduling,Antimatroid,Chordal graph,Clique tree,Gray code,Perfect elimination ordering","month":"October","number":"2","pages":"303--317","title":"Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph","type":"article","url":"http://www.sciencedirect.com/science/article/pii/S0304397503002214 http://linkinghub.elsevier.com/retrieve/pii/S0304397503002214","volume":"307","year":"2003","bibbaseid":"chandran-ibarra-ruskey-sawada-generatingandcharacterizingtheperfecteliminationorderingsofachordalgraph-2003","role":"author","urls":{"Paper":"http://www.sciencedirect.com/science/article/pii/S0304397503002214 http://linkinghub.elsevier.com/retrieve/pii/S0304397503002214"},"keyword":["2-Processor scheduling","Antimatroid","Chordal graph","Clique tree","Gray code","Perfect elimination ordering"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.443Z","downloads":0,"keywords":["2-processor scheduling","antimatroid","chordal graph","clique tree","gray code","perfect elimination ordering"],"search_terms":["generating","characterizing","perfect","elimination","orderings","chordal","graph","chandran","ibarra","ruskey","sawada"],"title":"Generating and Characterizing the Perfect Elimination Orderings of a Chordal Graph","year":2003,"dataSources":["YRMeqhMHoNu9HzJoC"]}