Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs.
Kathrin HanauerFranz-Josef BrandenburgChristopher AuerPublished in: WG (2013)
Keyphrases
- upper bound
- lower bound
- worst case
- constant factor
- branch and bound
- tight bounds
- upper and lower bounds
- lower and upper bounds
- branch and bound algorithm
- spanning tree
- minimum length
- graph theoretic
- error probability
- efficiently computable
- graph model
- graph matching
- upper bounding
- tight upper and lower bounds
- graph mining
- search algorithm
- graph representation
- relevance feedback
- semi supervised
- training set
- connected dominating set