Author:
Arkin Esther M,Papadimitriou Christos H
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference8 articles.
1. E.M. Arkin and C.H. Papadimitriou, “On the complexity of circulations”, Journal of Algorithms, forthcoming.
2. Matching, Euler tours and the Chinese postman;Edmonds;Math. Programming,1973
3. Algorithm 97, shortest path;Floyd;Comm. ACM,1962
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Combinatorial Optimization: Network and Matroids;Lawler,1976
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Arbitrage Behavior amongst Multiple Cryptocurrency Exchange Markets;2021 International Conference on Computational Science and Computational Intelligence (CSCI);2021-12
2. Shortest Paths in Nearly Conservative Digraphs;Parameterized and Exact Computation;2014
3. Minimum Weight Cycles and Triangles: Equivalences and Algorithms;2011 IEEE 52nd Annual Symposium on Foundations of Computer Science;2011-10
4. Basic Terminology, Notation and Results;Springer Monographs in Mathematics;2009
5. On the Circuit Cover Problem
for Mixed Graphs;Combinatorics, Probability and Computing;2002-01