Pages that link to "Item:Q4366872"
From MaRDI portal
The following pages link to Tight Bounds for the Maximum Acyclic Subgraph Problem (Q4366872):
Displaying 8 items.
- Intersections of random hypergraphs and tournaments (Q472404) (← 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)
- Improved algorithms via approximations of probability distributions (Q1582012) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- Maximal Acyclic Subgraphs and Closest Stable Matrices (Q5146694) (← links)
- Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
