@article{ Kanevsky1993,
  author = {Kanevsky, Arkady},
  doi = {10.1002/net.3230230604},
  issn = {00283045},
  journal = {Networks},
  month = {September},
  number = {6},
  pages = {533--541},
  title = {{Finding all minimum-size separating vertex sets in a graph}},
  url = {http://doi.wiley.com/10.1002/net.3230230604},
  volume = {23},
  year = {1993}
}

{"_id":"CQymGFrDSKNGm5ho9","authorIDs":[],"author_short":["Kanevsky, A."],"bibbaseid":"kanevsky-findingallminimumsizeseparatingvertexsetsinagraph-1993","bibdata":{"author":["Kanevsky, Arkady"],"author_short":["Kanevsky, A."],"bibtex":"@article{ Kanevsky1993,\n author = {Kanevsky, Arkady},\n doi = {10.1002/net.3230230604},\n issn = {00283045},\n journal = {Networks},\n month = {September},\n number = {6},\n pages = {533--541},\n title = {{Finding all minimum-size separating vertex sets in a graph}},\n url = {http://doi.wiley.com/10.1002/net.3230230604},\n volume = {23},\n year = {1993}\n}","bibtype":"article","doi":"10.1002/net.3230230604","id":"Kanevsky1993","issn":"00283045","journal":"Networks","key":"Kanevsky1993","month":"September","number":"6","pages":"533--541","title":"Finding all minimum-size separating vertex sets in a graph","type":"article","url":"http://doi.wiley.com/10.1002/net.3230230604","volume":"23","year":"1993","bibbaseid":"kanevsky-findingallminimumsizeseparatingvertexsetsinagraph-1993","role":"author","urls":{"Paper":"http://doi.wiley.com/10.1002/net.3230230604"},"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.167Z","downloads":0,"keywords":[],"search_terms":["finding","minimum","size","separating","vertex","sets","graph","kanevsky"],"title":"Finding all minimum-size separating vertex sets in a graph","year":1993,"dataSources":["YRMeqhMHoNu9HzJoC"]}