Pages that link to "Item:Q688447"

The following pages link to A fast and effective heuristic for the feedback arc set problem (Q688447):

Displaying 17 items.

• The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233) (← links)
• An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
• Combinatorial algorithms for feedback problems in directed graphs (Q1007586) (← links)
• Approximations of arbitrary relations by partial orders (Q1644912) (← links)
• Balanced vertex-orderings of graphs (Q1775059) (← links)
• Modeling the emergence of modular leadership hierarchy during the collective motion of herds made of harems (Q2342070) (← links)
• A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
• A Generalization of the Directed Graph Layering Problem (Q2961516) (← links)
• Compact Layered Drawings of General Directed Graphs (Q2961517) (← links)
• Efficient mode enumeration of compositional hybrid systems (Q3550796) (← links)
• MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS (Q4902886) (← links)
• Analysis of the equality relations for the program terms (Q5030193) (← links)
• The Network HHD: Quantifying Cyclic Competition in Trait-Performance Models of Tournaments (Q5075837) (← links)
• Tight Localizations of Feedback Sets (Q5102049) (← links)
• An Exact Method for the Minimum Feedback Arc Set Problem (Q5102057) (← links)
• Extremal results on feedback arc sets in digraphs (Q6119220) (← links)
• Effective Computation of a Feedback Arc Set Using PageRank (Q6181948) (← links)