Computing and Combinatorics
暂无分享,去创建一个
Kyung-Yong Chwa | J. van Leeuwen | Bernard Chazelle | Jan van Leeuwen | Tetsuo Asano | Binhai Zhu | Nina Amenta | Anne Condon | Jie Wang | Naoki Katoh | Tandy Warnow | Lusheng Wang | Zhixiang Chen | Michael Fellows | Robert Cimikowski | Francis Chin | Anna Gal | Michael Hallett | Daniel Huson
[1] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[2] Scott Aaronson,et al. Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.
[3] Ulrich Faigle. Combinatorial Geometries: Matroids in Combinatorial Optimization , 1987 .
[4] Sándor P. Fekete,et al. Characterizing matchings as the intersection of matroids , 2003, Math. Methods Oper. Res..
[5] James G. Oxley,et al. Matroid theory , 1992 .
[6] K. Wagner. Beweis einer Abschwächung der Hadwiger-Vermutung , 1964 .
[7] Rudolf Mathon,et al. A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..
[8] Leizhen Cai,et al. A generalization of line graphs: ( X, Y )-intersection graphs , 1996 .
[9] Panayiotis Psarrakos,et al. ON THE mth ROOTS OF A COMPLEX MATRIX , 2002 .
[10] J. Ian Munro,et al. Efficient Determination of the Transitive Closure of a Directed Graph , 1971, Inf. Process. Lett..
[11] D. West. Introduction to Graph Theory , 1995 .
[12] András Frank,et al. A Weighted Matroid Intersection Algorithm , 1981, J. Algorithms.
[13] Rajeev Motwani,et al. Computing Roots of Graphs Is Hard , 1994, Discret. Appl. Math..
[14] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[15] 岡本 吉央,et al. Submodularity of some classes of the combinatorial optimization games〔和文〕 , 2002 .
[16] F. Protti,et al. Clique-inverse graphs of bipartite graphs , 2004 .