Finding coherent cyclic orders in strong digraphs
暂无分享,去创建一个
[1] James B. Orlin. A Faster Strongly Polynomial Minimum Cost Flow Algorithm , 1993, Oper. Res..
[2] J. Smet. Quantum physics: Wheels within wheels , 2003, Nature.
[3] D. Knuth. Wheels within wheels , 1974 .
[4] András Sebö,et al. Minmax relations for cyclically ordered digraphs , 2007, J. Comb. Theory B.
[5] András Sebő,et al. Minmax relations for cyclically ordered digraphs , 2007 .
[6] Stéphan Thomassé,et al. Three Min-Max Theorems Concerning Cyclic Orders of Strong Digraphs , 2004, IPCO.
[7] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .