Algorithms for finding maximum transitive subtournaments
From MaRDI portal
Publication:5963652
DOI10.1007/s10878-014-9788-zzbMath1342.90164OpenAlexW1995372210MaRDI QIDQ5963652
Patric R. J. Östergård, Vesa P. Vaskelainen, Lasse Kiviluoto
Publication date: 23 February 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9788-z
directed acyclic graphcliquebacktrack searchfeedback vertex setRussian doll searchtransitive tournament
Related Items (3)
Coloring the nodes of a directed graph ⋮ A tournament of order 14 with disjoint Banks and Slater sets ⋮ Coloring the edges of a directed graph
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Russian doll search for the Steiner triple covering problem
- An exact algorithm for the maximum clique problem
- On locating minimum feedback vertex sets
- Qualitative independence and Sperner problems for directed graphs
- Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
- The maximum clique problem
- On the capacity of digraphs
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- A fast algorithm for the maximum clique problem
- The dichromatic number of a digraph
- Sperner capacity of small digraphs
- Clique-detection models in computational biochemistry and genomics
- Local chromatic number and Sperner capacity
- A polyhedral approach to the feedback vertex set problem
- Reducibility among Combinatorial Problems
This page was built for publication: Algorithms for finding maximum transitive subtournaments