Tight Bounds for the Maximum Acyclic Subgraph Problem.

Bonnie Berger Peter W. Shor

Published in: J. Algorithms (1997)

Keyphrases

tight bounds
upper bound
np hard
lower bound
np complete
database schemes
optimal solution
relational databases
search space
special case
maximum number
graph properties
information systems
graph mining
computational complexity
multi agent
case study