Pages that link to "Item:Q3796774"

The following pages link to Finding a minimum feedback arc set in reducible flow graphs (Q3796774):

Displaying 7 items.

• Packing feedback arc sets in reducible flow graphs (Q326500) (← links)
• Exact localisations of feedback sets (Q722200) (← links)
• More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
• Approximations for the maximum acyclic subgraph problem (Q1332750) (← links)
• Solving problems for maximal reducible flowgraphs. (Q1427189) (← links)
• A \(\min\)-\(\max\) relation in flowgraphs and some applications (Q1752483) (← links)
• Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs (Q2355284) (← links)