Towards transitive-free digraphs

DOI10.1016/J.TCS.2025.115270MaRDI QIDQ6985812zbMATH OpenFDO

Authors Ankit Abhinav, Satyabrata Jana, Abhishek Sahu

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-hardnesstournamentskernelizationFPTbounded independence numberDAGlocal tournamentstransitive-free digraphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Towards transitive-free digraphs

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