Doubling Algorithms with Permuted Lagrangian Graph Bases.

Volker Mehrmann Federico Poloni

Published in: SIAM J. Matrix Anal. Appl. (2012)

Keyphrases

graph theory
computational cost
significant improvement
bipartite graph
graph structure
graph representation
maximum flow
breadth first search
planar graphs
partitioning algorithm
relaxation algorithm
prize collecting