Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
Hostname: page-component-848d4c4894-wg55d Total loading time: 0 Render date: 2024-06-03T22:30:56.762Z Has data issue: false hasContentIssue false

References

Published online by Cambridge University Press:  03 December 2020

Christoph Dürr  and
Jill-Jênn Vie
Translated by
Greg Gibbons  and
Danièle Gibbons
Christoph Dürr
Affiliation:
Sorbonne University
Jill-Jênn Vie
Affiliation:
Inria
Get access

Summary

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Competitive Programming in Python
128 Algorithms to Develop your Coding Skills
 , pp. 248 - 250
Publisher: Cambridge University Press
Print publication year: 2020

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Ahuja, Ravindra K., Magnanti, Thomas L., and Orlin, James B. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice Hall.Google Scholar
Alt, Helmut, Blum, Norbert, Mehlhorn, Kurt, and Paul, Markus. 1991. Computing a Maximum Cardinality Matching in a Bipartite Graph in Time –math--. Information Processing Letters, 37(4), 237–240.CrossRefGoogle Scholar
Andrew, Alex M. 1979. Another Efficient Algorithm for Convex Hulls in Two Dimensions. Information Processing Letters, 9(5), 216–219.Google Scholar
Aspvall, Bengt, Plass, Michael F., and Tarjan, Robert Endre. 1979. A Linear-time Algorithm for Testing the Truth of Certain Quantified Boolean Formulas. Information Processing Letters, 8(3), 121–123.Google Scholar
Bellman, Richard. 1958. On a Routing Problem. Quarterly of Applied Mathematics, 16, 87–90.Google Scholar
Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., and Stein, Clifford. 2010. Algorithmique. Dunod.Google Scholar
Dilworth, R. P. 1950. A Decomposition Theorem for Partially Ordered Sets. Annals of Mathematics, 51(1), 161–166.Google Scholar
Dinitz, Yefim. 2006. Dinitz’ Algorithm: The Original Version and Even’s Version. Berlin, Heidelberg: Springer Berlin Heidelberg. Pages 218–240.Google Scholar
Edmonds, Jack. 1965. Paths, Trees, and Flowers. Canadian Journal of Mathematics, 17(3), 449–467.Google Scholar
Edmonds, Jack, and Johnson, Ellis L. 1973. Matching, Euler Tours and the Chinese Postman. Mathematical Programming, 5(1), 88–124.Google Scholar
Edmonds, Jack, and Karp, Richard M. 1972. Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. Journal of the ACM, 19(2), 248–264.Google Scholar
Elias, Peter, Feinstein, Amiel, and Shannon, Claude. 1956. A Note on the Maximum Flow through a Network. IRE Transactions on Information Theory, 2(4), 117–119.Google Scholar
Fenwick, Peter M. 1994. A New Data Structure for Cumulative Frequency Tables. Software: Practice and Experience, 24(3), 327–336.Google Scholar
Floyd, Robert W. 1962. Algorithm 97: Shortest Path. Communications of the ACM, 5(6), 345–.Google Scholar
Ford, Lester Randolph. 1956. Network Flow Theory. Tech. rept. P-923. RAND Corporation.Google Scholar
Ford, L. R., and Fulkerson, D. R. 1956. Maximal Flow through a Network. Canadian Journal of Mathematics, 8, 399–404.Google Scholar
Fredman, Michael L., and Tarjan, Robert Endre. 1987. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. Journal of the ACM, 34(3), 596–615.CrossRefGoogle Scholar
Freivalds, Rūsin, š. 1979. Fast Probabilistic Algorithms. Pages 57–69 of: Mathematical Foundations of Computer Science 1979. Springer.Google Scholar
Gabow, Harold N. 1976. An Efficient Implementation of Edmonds’ Algorithm for Maximum Matching on Graphs. Journal of the ACM, 23(2), 221–234.Google Scholar
Gajentaan, Anka, and Overmars, Mark H. 1995. On a Class of O(n2) Problems in Computational Geometry. Computational Geometry, 5(3), 165–185.Google Scholar
Gale, David, and Shapley, Lloyd S. 1962. College Admissions and the Stability of Marriage. American Mathematical Monthly, 9–15.Google Scholar
Goldberg, Andrew V., and Rao, Satish. 1998. Beyond the Flow Decomposition Barrier. Journal of the ACM, 45(5), 783–797.Google Scholar
Gries, David, and Misra, Jayadev. 1978. A Linear Sieve Algorithm for Finding Prime Numbers. Communications of the ACM, 21(12), 999–1003.Google Scholar
Hierholzer, Carl, and Wiener, Chr. 1873. Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen, 6(1), 30–32.Google Scholar
Hitotumatu, Hirosi, and Noshita, Kohei. 1979. A Technique for Implementing Backtrack Algorithms and Its Application. Information Processing Letters, 8(4), 174–175.Google Scholar
Hopcroft, John, and Karp, Richard. 1972. An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. SIAM Journal on Computing, 2(4), 225–231.Google Scholar
Hopcroft, John, and Tarjan, Robert. 1973. Algorithm 447: Efficient Algorithms for Graph Manipulation. Communications of the ACM, 16(6), 372–378.Google Scholar
Hougardy, Stefan. 2010. The Floyd–Warshall Algorithm on Graphs with Negative Cycles. Information Processing Letters, 110(8-9), 279–281.Google Scholar
Hu, T. C., and Shing, M. T. 1984. Computation of Matrix Chain Products. Part II. SIAM Journal on Computing, 13(2), 228–251.Google Scholar
Huffman, David A. 1952. A Method for the Construction of Minimum-Redundancy Codes. Proceedings of the IRE, 40(9), 1098–1101.Google Scholar
Karp, Richard M. 1978. A Characterization of the Minimum Cycle Mean in a Digraph. Discrete Mathematics, 23(3), 309–311.Google Scholar
Karp, Richard M., and Rabin, M. O. 1987. Efficient Randomized Pattern-Matching Algorithms. IBM Journal of Research and Development, 31(2), 249–260.CrossRefGoogle Scholar
Knuth, Donald E. 2000. Dancing Links. arXiv preprint cs/0011047.Google Scholar
Knuth, Donald E., Morris, Jr, James, H., and Pratt, Vaughan R. 1977. Fast Pattern Matching in Strings. SIAM Journal on Computing, 6(2), 323–350.Google Scholar
Kosaraju, S. Rao. 1979. Fast Parallel Processing array Algorithms for Some Graph Problems (Preliminary Version). Pages 231–236 of: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing. ACM.Google Scholar
Kozen, Dexter C. 1992. The Design and Analysis of Algorithms. Springer Verlag.Google Scholar
Kruskal, Joseph B. 1956. On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society, 7(1), 48–50.Google Scholar
Kuhn, Harold W. 1955. The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2, 83–97.Google Scholar
Lo, Chi-Yuan, Matoušek, Jiří, and Steiger, William. 1994. Algorithms for Ham-Sandwich Cuts. Discrete & Computational Geometry, 11(1), 433–452.Google Scholar
Manacher, Glenn. 1975. A New Linear-Time On-Line Algorithm for Finding the Smallest Initial Palindrome of a String. Journal of the ACM, 22(3), 346–351.Google Scholar
Moore, Edward F. 1959. The Shortest Path through a Maze. Pages 285–292 of: Proceedings of the International Symposium on Switching Theory 1957, Part II. Harvard Univ. Press, Cambridge, Mass.Google Scholar
Morrison, Donald R. 1968. PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric. Journal of the ACM, 15(4), 514–534.Google Scholar
Munkres, James. 1957. Algorithms for the Assignment and Transportation Problems. Journal of the Society for Industrial and Applied Mathematics, 5(1), 32–38.Google Scholar
Ollivier, François. 2009a. Looking for the Order of a System of Arbitrary Ordinary Differential Equations. Applicable Algebra in Engineering, Communication and Computing, 20(1), 7–32.Google Scholar
Ollivier, François. 2009b. The Reduction to Normal Form of a Non-normal System of Differential Equations. Applicable Algebra in Engineering, Communication and Computing, 20(1), 33–64.Google Scholar
Papadimitriou, Christos H. 2003. Computational Complexity. John Wiley and Sons Ltd.Google Scholar
Roy, Bernard. 1959. Transitivité et connexité. Comptes rendus de l’Académie des Sciences, 249, 216–218.Google Scholar
Schrijver, Alexander. 2002. On the History of the Transportation and Maximum Flow Problems. Mathematical Programming, 91(3), 437–445.Google Scholar
Stoer, Mechthild, and Wagner, Frank. 1997. A Simple Min-Cut Algorithm. Journal of the ACM, 44(4), 585–591.Google Scholar
Strassen, Volker. 1969. Gaussian Elimination Is Not Optimal. Numerische Mathematik, 13(4), 354–356.CrossRefGoogle Scholar
Tarjan, Robert. 1972. Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing, 1(2), 146–160.Google Scholar
Ukkonen, Esko. 1985. Finding Approximate Patterns in Strings. Journal of Algorithms, 6(1), 132–137.Google Scholar
Warshall, Stephen. 1962. A Theorem on Boolean Matrices. Journal of the ACM, 9(1), 11–12.Google Scholar
Yang, I-Hsuan, Huang, Chien-Pin, and Chao, Kun-Mao. 2005. A Fast Algorithm for Computing a Longest Common Increasing Subsequence. Information Processing Letters, 93(5), 249–253.Google Scholar

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×