Listing All Minimal Separators of a Graph. Kloks, T. & Kratsch, D. SIAM Journal on Computing, 27(3):605--613, June, 1998.
Listing All Minimal Separators of a Graph [link]Paper  doi  bibtex   
@article{ Kloks1998,
  author = {Kloks, T. and Kratsch, D.},
  doi = {10.1137/S009753979427087X},
  file = {:Users/KunihiroWASA/Dropbox/paper/1998/Kloks, Kratsch, Listing All Minimal Separators of a Graph, 1998.pdf:pdf},
  issn = {0097-5397},
  journal = {SIAM Journal on Computing},
  keywords = {05c85,1,68r10,algorithm,ams subject classifications,given a graph,good pair,graph,in listing certain sub-,introduction,listing algorithm,minimal pair,minimal separator,one is often interested,pii,s009753979427087x},
  month = {June},
  number = {3},
  pages = {605--613},
  title = {{Listing All Minimal Separators of a Graph}},
  url = {http://epubs.siam.org/doi/abs/10.1137/S009753979427087X},
  volume = {27},
  year = {1998}
}

Downloads: 0