论文信息 - Computing Girth and Cogirth in Perturbed Graphic Matroids - 字舞流文

Computing Girth and Cogirth in Perturbed Graphic Matroids

J. Geelen | Rohan Kapadia

[1] Bert Gerards,et al. The Highly Connected Matroids in Minor-Closed Classes , 2013, 1312.5012.

[2] Meena Mahajan,et al. The combinatorial approach yields an NC algorithm for computing Pfaffians , 2004, Discret. Appl. Math..

[3] Alexander Vardy,et al. The intractability of computing the minimum distance of a code , 1997, IEEE Trans. Inf. Theory.

[4] David R. Karger,et al. A new approach to the minimum cut problem , 1996, JACM.

[5] Michele Conforti,et al. A construction for binary matroids , 1987, Discret. Math..

[6] Michele Conforti,et al. Some New Matroids on Graphs: Cut Sets and the Max Cut Problem , 1987, Math. Oper. Res..

[7] Vijay V. Vazirani,et al. Matching is as easy as matrix inversion , 1987, STOC.

[8] M. R. Rao,et al. Odd Minimum Cut-Sets and b-Matchings , 1982, Math. Oper. Res..

[9] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[10] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.

[11] W. T. Tutte. The Factorization of Linear Graphs , 1947 .

[12] David R. Karger,et al. Global min-cuts in RNC, and other ramifications of a simple min-out algorithm , 1993, SODA '93.

[13] László Lovász,et al. On determinants, matchings, and random algorithms , 1979, FCT.