Pages that link to "Item:Q3630222"
From MaRDI portal
The following pages link to Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments (Q3630222):
Displaying 4 items.
- On the complexity of compressing two dimensional routing tables with order (Q1702127) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Circular Convex Bipartite Graphs: Feedback Vertex Set (Q2867126) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)