Listing All Minimal Separators of a Graph. Kloks, T. & Kratsch, D. SIAM Journal on Computing, 27(3):605--613, June, 1998.
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
{"_id":"mpgLncy9xyqkMep5A","authorIDs":[],"author_short":["Kloks, T.","Kratsch, D."],"bibbaseid":"kloks-kratsch-listingallminimalseparatorsofagraph-1998","bibdata":{"author":["Kloks, T.","Kratsch, D."],"author_short":["Kloks, T.","Kratsch, D."],"bibtex":"@article{ Kloks1998,\n author = {Kloks, T. and Kratsch, D.},\n doi = {10.1137/S009753979427087X},\n file = {:Users/KunihiroWASA/Dropbox/paper/1998/Kloks, Kratsch, Listing All Minimal Separators of a Graph, 1998.pdf:pdf},\n issn = {0097-5397},\n journal = {SIAM Journal on Computing},\n 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},\n month = {June},\n number = {3},\n pages = {605--613},\n title = {{Listing All Minimal Separators of a Graph}},\n url = {http://epubs.siam.org/doi/abs/10.1137/S009753979427087X},\n volume = {27},\n year = {1998}\n}","bibtype":"article","doi":"10.1137/S009753979427087X","file":":Users/KunihiroWASA/Dropbox/paper/1998/Kloks, Kratsch, Listing All Minimal Separators of a Graph, 1998.pdf:pdf","id":"Kloks1998","issn":"0097-5397","journal":"SIAM Journal on Computing","key":"Kloks1998","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","type":"article","url":"http://epubs.siam.org/doi/abs/10.1137/S009753979427087X","volume":"27","year":"1998","bibbaseid":"kloks-kratsch-listingallminimalseparatorsofagraph-1998","role":"author","urls":{"Paper":"http://epubs.siam.org/doi/abs/10.1137/S009753979427087X"},"keyword":["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"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.690Z","downloads":0,"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"],"search_terms":["listing","minimal","separators","graph","kloks","kratsch"],"title":"Listing All Minimal Separators of a Graph","year":1998,"dataSources":["YRMeqhMHoNu9HzJoC"]}