Symplectic Spaces And Ear-Decomposition Of Matroids
暂无分享,去创建一个
[1] W. T. Tutte. The Factorization of Linear Graphs , 1947 .
[2] Richard Zippel,et al. Probabilistic algorithms for sparse polynomials , 1979, EUROSAM.
[3] László Lovász,et al. On determinants, matchings, and random algorithms , 1979, FCT.
[4] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[5] François Jaeger. Graphes de Cordes et Espaces Graphiques , 1983, Eur. J. Comb..
[6] F. Jaeger. Symmetric Representations of Binary Matroids , 1983 .
[7] András Frank,et al. Conservative weightings and ear-decompositions of graphs , 1990, Comb..
[8] Chris D. Godsil,et al. ALGEBRAIC COMBINATORICS , 2013 .
[9] Zoltán Szigeti. On a matroid defined by ear-decompositions of graphs , 1996, Comb..
[10] Lisa Hellerstein,et al. Independence and port oracles for matroids, with an application to computational learning theory , 1996, Comb..
[11] William H. Cunningham,et al. The optimal path-matching problem , 1997, Comb..
[12] Zoltán Szigeti. On Generalizations of Matching-covered Graphs , 2001, Eur. J. Comb..