Algorithms for finding maximum transitive subtournaments

DOI10.1007/S10878-014-9788-ZzbMATH Open1342.90164OpenAlexW1995372210MaRDI QIDQ5963652FDOQ5963652

Authors: Lasse Kiviluoto, Patric R. J. Östergård, Vesa Vaskelainen 

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

Recommendations

• Coloring the edges of a directed graph
• The complexity of finding certain trees in tournaments
• Some extremal properties concerning transitivity in graphs
• Coloring the nodes of a directed graph
• A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

zbMATH Keywords

directed acyclic graphcliquefeedback vertex setRussian doll searchtransitive tournamentbacktrack search

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• The maximum clique problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reducibility among Combinatorial Problems
• Title not available (Why is that?)
• A fast algorithm for the maximum clique problem
• Clique-detection models in computational biochemistry and genomics
• The dichromatic number of a digraph
• Sperner capacity of small digraphs
• Local chromatic number and Sperner capacity
• On locating minimum feedback vertex sets
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• An exact algorithm for the maximum clique problem
• Russian doll search for the Steiner triple covering problem
• Exact computation of minimum feedback vertex sets with relational algebra
• A polyhedral approach to the feedback vertex set problem
• Qualitative independence and Sperner problems for directed graphs
• Title not available (Why is that?)
• Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities
• On the capacity of digraphs

Cited In (5)

• Coloring the nodes of a directed graph
• Coloring the edges of a directed graph
• An optimal algorithm for finding all convex subsets in tournaments
• Design, implementation, and analysis of maximum transversal algorithms
• A tournament of order 14 with disjoint Banks and Slater sets

Uses Software

• CLIP

This page was built for publication: Algorithms for finding maximum transitive subtournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963652)