Pages that link to "Item:Q845963"
From MaRDI portal
The following pages link to Feedback arc set in bipartite tournaments is NP-complete (Q845963):
Displaying 10 items.
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- On the complexity of compressing two dimensional routing tables with order (Q1702127) (← links)
- A quadratic vertex kernel for feedback arc set in bipartite tournaments (Q2258074) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)
- Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
- A better LP rounding for feedback arc set on tournaments (Q6614011) (← links)
- Computing the EHZ capacity is \(\operatorname{NP}\)-hard (Q6652100) (← links)
