@article{Abel1982,
author = "Abel, U. and Bicker, R.",
doi = "10.1109/TR.1982.5221285",
issn = "0018-9529",
journal = "IEEE Transactions on Reliability",
keyword = "Algorithm,Cut-set enumeration,Undirected graph",
link = "http://ieeexplore.ieee.org/document/5221285/",
month = "jun",
number = "2",
pages = "167--171",
title = "Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph",
uri = "http://ieeexplore.ieee.org/document/5221285/",
volume = "R-31",
year = "1982",
}
@article{Berry2000,
author = "Berry, Anne and Bordat, Jean-Paul and Cogis, Olivier",
doi = "10.1142/S0129054100000211",
issn = "0129-0541",
journal = "International Journal of Foundations of Computer Science",
keyword = "Enumeration Algorithm,Graph,Minimal separator,enumeration algorithm,graph,minimal separator",
language = "en",
link = "http://www.worldscientific.com/doi/abs/10.1142/S0129054100000211",
month = "sep",
number = "03",
pages = "397--403",
publisher = "World Scientific Publishing Company",
title = "Generating All the Minimal Separators of a Graph",
uri = "http://www.worldscientific.com/doi/abs/10.1142/S0129054100000211",
volume = "11",
year = "2000",
}
@inproceedings{Chandran2001,
address = "Guilin, China",
author = "Chandran, LS",
booktitle = "COCOON 2001: the 7th Annual International Conference Computing and Combinatorics",
doi = "10.1007/3-540-44679-6_34",
editor = "Wang, Jie",
link = "http://link.springer.com/chapter/10.1007/3-540-44679-6_34",
month = "aug",
pages = "308--317",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph",
uri = "http://link.springer.com/chapter/10.1007/3-540-44679-6_34",
volume = "2108",
year = "2001",
}
@article{Hamacher1984a,
author = "Hamacher, Horst W. and Picard, Jean-Claude and Queyranne, Maurice",
doi = "10.1016/0167-6377(84)90083-X",
issn = "01676377",
journal = "Operations Research Letters",
keyword = "Flow algorithm,cut,ranking of solutions",
link = "http://www.sciencedirect.com/science/article/pii/016763778490083X http://linkinghub.elsevier.com/retrieve/pii/016763778490083X",
month = "mar",
number = "6",
pages = "303--305",
title = "On Finding the K Best Cuts in a Network",
uri = "http://www.sciencedirect.com/science/article/pii/016763778490083X",
volume = "2",
year = "1984",
}
@inproceedings{HeejongSuh2000,
author = "{Heejong Suh} and Chang, C.K.",
booktitle = "Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000",
doi = "10.1109/LCN.2000.891015",
isbn = "0-7695-0912-6",
issn = "07421303",
link = "http://ieeexplore.ieee.org/document/891015/",
pages = "100--107",
publisher = "IEEE Comput. Soc",
title = "Algorithms for the minimal cutsets enumeration of networks by graph search and branch addition",
uri = "http://ieeexplore.ieee.org/document/891015/",
year = "2000",
}
@article{Kanevsky1993,
author = "Kanevsky, Arkady",
doi = "10.1002/net.3230230604",
issn = "00283045",
journal = "Networks",
link = "http://doi.wiley.com/10.1002/net.3230230604",
month = "sep",
number = "6",
pages = "533--541",
title = "Finding all minimum-size separating vertex sets in a graph",
uri = "http://doi.wiley.com/10.1002/net.3230230604",
volume = "23",
year = "1993",
}
@inproceedings{Khachiyan2005,
address = "Sanya, Hainan, China",
author = "Khachiyan, L and Boros, E and Borys, K",
booktitle = "ISAAC 2005: the 16th International Symposium on Algorithms and Computation",
doi = "10.1007/11602613_17",
editor = "Deng, Xiaotie and Du, Ding-Zhu",
link = "http://link.springer.com/chapter/10.1007/11602613_17",
month = "dec",
pages = "156--165",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Generating Cut Conjunctions and Bridge Avoiding Extensions in Graphs",
uri = "http://link.springer.com/chapter/10.1007/11602613_17",
volume = "3827",
year = "2005",
}
@article{Khachiyan2007,
author = "Khachiyan, Leonid and Boros, Endre and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa",
doi = "10.1016/j.dam.2006.04.032",
issn = "0166218X",
journal = "Discrete Applied Mathematics",
month = "jan",
number = "2",
pages = "137--149",
title = "Enumerating disjunctions and conjunctions of paths and cuts in reliability theory",
volume = "155",
year = "2007",
}
@article{Khachiyan2008a,
author = "Khachiyan, Leonid and Boros, Endre and Borys, Konrad and Elbassioni, Khaled and Gurvich, Vladimir and Makino, Kazuhisa",
doi = "10.1007/s00453-007-9111-9",
issn = "01784617",
journal = "Algorithmica",
keyword = "Cut conjunction,Cut generation,Graph,Matroid,Multicut",
link = "http://link.springer.com/article/10.1007\%2Fs00453-007-9111-9",
number = "3",
pages = "239--263",
title = "Generating cut conjunctions in graphs and related problems",
uri = "http://link.springer.com/article/10.1007%2Fs00453-007-9111-9",
volume = "51",
year = "2008",
}
@inproceedings{Kloks1994,
address = "France",
author = "Kloks, T and Kratsch, D",
booktitle = "STACS 1994: the 11th Annual Symposium on Theoretical Aspects of Computer Science",
doi = "10.1007/3-540-57785-8_188",
editor = "Enjalbert, Patrice and Mayr, Ernst W. and Wagner, Klaus W.",
link = "http://link.springer.com/content/pdf/10.1007/3-540-57785-8_188.pdf",
month = "feb",
pages = "759--768",
publisher = "Springer Berlin Heidelberg",
series = "Lecture Notes in Computer Science",
title = "Finding all minimal separators of a graph",
uri = "http://link.springer.com/content/pdf/10.1007/3-540-57785-8_188.pdf",
volume = "775",
year = "1994",
}
@article{Kloks1998,
author = "Kloks, T. and Kratsch, D.",
doi = "10.1137/S009753979427087X",
issn = "0097-5397",
journal = "SIAM Journal on Computing",
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",
link = "http://epubs.siam.org/doi/abs/10.1137/S009753979427087X",
month = "jun",
number = "3",
pages = "605--613",
title = "Listing All Minimal Separators of a Graph",
uri = "http://epubs.siam.org/doi/abs/10.1137/S009753979427087X",
volume = "27",
year = "1998",
}
@article{Laumond1985,
author = "Laumond, Jean-Paul",
doi = "10.1016/0020-0190(85)90055-9",
issn = "00200190",
journal = "Information Processing Letters",
keyword = "Planar graph,connectivity",
link = "http://www.sciencedirect.com/science/article/pii/0020019085900559 http://linkinghub.elsevier.com/retrieve/pii/0020019085900559",
month = "oct",
number = "4",
pages = "173--179",
title = "Enumeration of articulation pairs of a planar graph",
uri = "http://www.sciencedirect.com/science/article/pii/0020019085900559",
volume = "21",
year = "1985",
}
@article{Martelli1976a,
author = "Martelli, Alberto",
doi = "10.1145/321921.321928",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=321921.321928 http://portal.acm.org/citation.cfm?doid=321921.321928",
month = "jan",
number = "1",
pages = "58--73",
publisher = "ACM",
title = "A Gaussian Elimination Algorithm for the Enumeration of Cut Sets in a Graph",
uri = "http://dl.acm.org/citation.cfm?id=321921.321928",
volume = "23",
year = "1976",
}
@article{Mazoit2006,
author = "Mazoit, F.",
doi = "10.1016/j.disc.2005.12.007",
issn = "0012365X",
journal = "Discrete Mathematics",
keyword = "Enumeration,Minimal separator,Planar graphs",
link = "http://www.sciencedirect.com/science/article/pii/S0012365X05006138 http://linkinghub.elsevier.com/retrieve/pii/S0012365X05006138",
month = "feb",
number = "3",
pages = "372--380",
title = "Listing all the minimal separators of a 3-connected planar graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0012365X05006138",
volume = "306",
year = "2006",
}
@article{Nagamochi1997,
author = "Nagamochi, Hiroshi and Nishimura, Kazuhiro and Ibaraki, Toshihide",
doi = "10.1137/S0895480194271323",
issn = "0895-4801",
journal = "SIAM Journal on Discrete Mathematics",
number = "3",
pages = "469--481",
title = "Computing All Small Cuts in an Undirected Network",
volume = "10",
year = "1997",
}
@article{Provan1996,
author = "Provan, J. S. and Shier, D. R.",
doi = "10.1007/BF01961544",
issn = "0178-4617",
journal = "Algorithmica",
link = "http://link.springer.com/10.1007/BF01961544",
month = "apr",
number = "4",
pages = "351--372",
title = "A paradigm for listing (s, t)-cuts in graphs",
uri = "http://link.springer.com/10.1007/BF01961544",
volume = "15",
year = "1996",
}
@article{Shen1997,
author = "Shen, Hong and Liang, Weifa",
doi = "10.1016/S0304-3975(97)83809-1",
issn = "03043975",
journal = "Theoretical Computer Science",
link = "http://www.sciencedirect.com/science/article/pii/S0304397597838091 http://linkinghub.elsevier.com/retrieve/pii/S0304397597838091",
month = "jun",
number = "1-2",
pages = "169--180",
title = "Efficient Enumeration of All Minimal Separators in a Graph",
uri = "http://www.sciencedirect.com/science/article/pii/S0304397597838091",
volume = "180",
year = "1997",
}
@article{Tsukiyama1980,
author = "Tsukiyama, S. and Shirakawa, I. and Ozaki, H. and Ariyoshi, H.",
doi = "10.1145/322217.322220",
issn = "00045411",
journal = "Journal of the ACM",
link = "http://dl.acm.org/citation.cfm?id=322217.322220 http://portal.acm.org/citation.cfm?doid=322217.322220",
month = "oct",
number = "4",
pages = "619--632",
publisher = "ACM",
title = "An Algorithm to Enumerate All Cutsets of a Graph in Linear Time Per Cutset",
uri = "http://dl.acm.org/citation.cfm?id=322217.322220",
volume = "27",
year = "1980",
}
@article{Yeh2010,
author = "Yeh, Li Pu and Wang, Biing Feng and Su, Hsin Hao",
doi = "10.1007/s00453-009-9284-5",
isbn = "0045300992",
issn = "01784617",
journal = "Algorithmica",
keyword = "Algorithms,Enumeration,Graphs,Maximum flows,Minimum cuts,Suboptimal cuts",
link = "http://link.springer.com/article/10.1007/s00453-009-9284-5",
number = "3",
pages = "297--312",
title = "Efficient algorithms for the problems of enumerating cuts by non-decreasing weights",
uri = "http://link.springer.com/article/10.1007/s00453-009-9284-5",
volume = "56",
year = "2010",
}