论文信息 - On the Complexity of Circulations - 字舞流文

On the Complexity of Circulations

Esther M. Arkin | Christos H. Papadimitriou | C. Papadimitriou | E. Arkin

[1] Uzi Vishkin,et al. An O(n² log n) Parallel MAX-FLOW Algorithm , 1982, J. Algorithms.

[2] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[3] Nimrod Megiddo,et al. Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[4] Christos H. Papadimitriou,et al. On the complexity of edge traversing , 1976, J. ACM.

[5] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..

[6] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .