Instruct: Given a scientific paper title, retrieve paper titles that are cited by the given paper.
Query: Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
A note on the maximum flow through a network
Maximum flows and parametric shortest paths in planar graphs
Commute Times for a Directed Graph using an Asymmetric Laplacian
Network Flow Query Language—Design, Implementation, Performance, and Applications
Approximations For The Maximum Acyclic Subgraph Problem
Approximating fractional multicommodity flow independent of the number of commodities
Robust discrete optimization and network flows
Planar graphs, negative weight edges, shortest paths, and near linear time
Auction Algorithms for Network Flow Problems: A Tutorial Introduction
Unifying Maximum Cut and Minimum Cut of a Planar Graph
Centrality and Network Flow
Laplacian dynamics on general graphs.
A 5/4-approximation algorithm for minimum 2-edge-connectivity
Efficient algorithms for finding maximum matching in graphs
A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs
A generic auction algorithm for the minimum cost network flow problem
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
I/O-complexity of graph algorithms
A new approach to the minimum cut problem
The Floyd-Warshall algorithm on graphs with negative cycles
Modeling and simulation of FPGA-based variable-speed drives using Simulink
Introduction to Algorithms
Plasmonic near-field transducer for heat-assisted magnetic recording
A review of research on the impact of professional learning communities on teaching practice and student learning
Post-dural puncture headache: pathophysiology, prevention and treatment.