Tight Bounds for the Maximum Acyclic Subgraph Problem
From MaRDI portal
Publication:4366872
DOI10.1006/jagm.1997.0864zbMath0888.68088OpenAlexW1990255213WikidataQ57394590 ScholiaQ57394590MaRDI QIDQ4366872
Publication date: 25 November 1997
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0864
Related Items (8)
A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Extremal results on feedback arc sets in digraphs ⋮ Intersections of random hypergraphs and tournaments ⋮ Maximal Acyclic Subgraphs and Closest Stable Matrices ⋮ Abstraction-based failure diagnosis for discrete event systems ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Balanced vertex-orderings of graphs ⋮ Improved algorithms via approximations of probability distributions
This page was built for publication: Tight Bounds for the Maximum Acyclic Subgraph Problem