Pages that link to "Item:Q534571"
From MaRDI portal
The following pages link to Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571):
Displaying 5 items.
- Circular convex bipartite graphs: feedback vertex sets (Q300230) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
