Pages that link to "Item:Q3078379"
From MaRDI portal
The following pages link to The Complexity of Acyclic Subhypergraph Problems (Q3078379):
Displaying 5 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- (Q3403196) (← links)
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay (Q3599072) (← links)
- Tight Bounds for the Maximum Acyclic Subgraph Problem (Q4366872) (← links)
- (Q4780790) (← links)