Implicit Computation of Minimum-Cost Feedback-Vertex Sets for Partial Scan and Other Applications.

Pranav Ashar Sharad Malik

Published in: DAC (1994)

Keyphrases

minimum cost
undirected graph
np hard
approximation algorithms
network flow problem
spanning tree
network flow
capacity constraints
explicit feedback
network simplex algorithm
minimum cost flow
lower bound
special case