scientific article; zbMATH DE number 6829390

DOI10.4230/LIPIcs.STACS.2016.49zbMath1388.68324arXiv1510.07676MaRDI QIDQ4601901

Mithilesh Kumar, Daniel Lokshtanov

Publication date: 24 January 2018

Full work available at URL: https://arxiv.org/abs/1510.07676

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

tournamentsfeedback vertex setparameterized algorithmsexact algorithmsgraph partitions

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items

A parameterized algorithm for subset feedback vertex set in tournaments, Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number, Conflict free version of covering problems on graphs: classical and parameterized, Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number, Tournaments and Semicomplete Digraphs, Tractability of König edge deletion problems