Degreewidth: A New Parameter for Solving Problems on Tournaments

DOI10.1007/978-3-031-43380-1_18MaRDI QIDQ6496550

Jocelyn Thiebaut, Tom Davot, Lucas Isenmann, Sanjukta Roy

Publication date: 3 May 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tournament solutions and majority voting
• Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs
• Comparing linear width parameters for directed graphs
• Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
• The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Packing Arc-Disjoint Cycles in Tournaments
• Triangle packing in (sparse) tournaments: approximation and kernelization
• Finding All the Elementary Circuits of a Directed Graph
• Ranking Tournaments
• Digraphs

This page was built for publication: Degreewidth: A New Parameter for Solving Problems on Tournaments