David Eisenstat questions

David Eisenstat answers

• Backtracking: List all possible matrices with row and column sum constraints
• Max flow: how to force f units to flow, with minimal changes to capacity?
• Min Cost Max Flow algorithm that focuses on equal distribution of flow across all edges, as much as possible
• Rabin fingerprinting tables
• Calculating the number of graphs created and the number of vertices in each graph from a list of edges
• Top-k scoring across multiple dimensions
• Finding the sum of products of first and last elements in a range, second and second last and so on using segment tree
• Maximum "divide" operations on an array
• Given a weighted graph and natural number k how to find the cheapest path from node s to t that can be divided by k?
• After running a max flow algorithm, find in a flow network all edges that are in some min-cut