Algorithms for enumerating circuits in matroids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 485-494

  Boros, Endre ^a   Elbassioni, Khaled ^a   Gurvich, Vladimir ^a   Khachiyan, Leonid ^b  

^a RUTGERS UNIVERSITY   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; POLYNOMIAL APPROXIMATION;

ENUMERATION PROBLEMS; FEASIBLE SUBSYSTEMS; NP-HARDNESS; POLYNOMIAL-TIME ALGORITHMS; SPANNING SETS; SYSTEM OF LINEAR EQUATIONS;

ALGORITHMS;

EID: 35248852015     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_50     Document Type: Article

References (11)

1. E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan, Matroid intersections, polymatroid inequalities, and related problems, in Proc. 27th Intl. Symp. on Mathematical Foundations of Computer Science, (MFCS) 3002, LNCS 2420, pp. 143-154.
2. J. Edmonds, Submodular functions, matroids, and certain polyhedra, in Combinatorial structures and their applications, Gordon and Breach, 69-87.
3. T. Eiter and G. Gottlob, Identifying the minimal transversals of a hypergraph and related problems, SIAM J. Comput., 24 (1995) 1278-1304.
4. R. Karp, On the complexity of combinatorial problems, Networks 5 (1975) 45-68.
5. T. Lazarson, Independence functions in algebra, (Thesis), Univ. London (1957).
6. A. Lehman, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math. 12 (1964) 687-725.
7. L. Lovász, Submodular functions and convexity, in Mathematical Programming: The State of the Art, Bonn 1982, pp. 235-257, (Springer Verlag, 1983).
8. J. S. Provan and D. R. Shier, A paradigm for listing (s,t)-cuts in graphs, Algorithmica, 15(4) (1996) 357-372.
9. R. C. Read and R. E. Tarjan, Bounds on backtrack algorithms for listing cycles, paths, and spanning trees, Networks, 5 (1975) 237-252.
10. N. Robertson and P. D. Seymour, Graph minors, XIII, The disjoint path problem, J. Comb. Th., Ser. B 63 (1995) 65-110.
11. D.J.A. Welsh, Matroid Theory, Academic Press, 1976.