Pages that link to "Item:Q4366872"
From MaRDI portal
The following pages link to Tight Bounds for the Maximum Acyclic Subgraph Problem (Q4366872):
Displaying 17 items.
- Intersections of random hypergraphs and tournaments (Q472404) (← links)
- On the maximum acyclic subgraph problem under disjunctive constraints (Q477599) (← links)
- Abstraction-based failure diagnosis for discrete event systems (Q962191) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Bounded degree acyclic decompositions of digraphs. (Q1426101) (← links)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Listing acyclic subgraphs and subgraphs of bounded girth in directed graphs (Q1708606) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- The covering threshold of a directed acyclic graph by directed acyclic subgraphs (Q2112584) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Coloring graphs using two colors while avoiding monochromatic cycles (Q2815462) (← links)
- Directed acyclic subgraph problem parameterized above the Poljak-Turzík bound (Q2957516) (← links)
- The Complexity of Acyclic Subhypergraph Problems (Q3078379) (← links)
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay (Q3599072) (← links)
- (Q4780790) (← links)
- Maximal Acyclic Subgraphs and Closest Stable Matrices (Q5146694) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)