@inbook{332a4ef138c9450ba785392680982957,
title = "Algorithms for enumerating circuits in matroids",
abstract = "We present an incremental polynomial-time algorithm for enumerating all circuits of a matroid or, more generally, all minimal spanning sets for a flat. This result implies, in particular, that for a given infeasible system of linear equations, all its maximal feasible subsystems, as well as all minimal infeasible subsystems, can be enumerated in incremental polynomial time. We also show the NP-hardness of several related enumeration problems.",
author = "Endre Boros and Khaled Elbassioni and Vladimir Gurvich and Leonid Khachiyan",
year = "2003",
doi = "10.1007/978-3-540-24587-2_50",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "485--494",
editor = "Toshihide Ibaraki and Naoki Katoh and Hirotaka Ono",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "Germany",
}