On finding a minimum dominating set in a tournament
From MaRDI portal
Publication:1113678
DOI10.1016/0304-3975(88)90131-4zbMath0661.68064OpenAlexW2013155780MaRDI QIDQ1113678
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90131-4
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20)
Related Items (23)
Absorbant of generalized de Bruijn digraphs ⋮ Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows ⋮ Domination and fractional domination in digraphs ⋮ Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ A note on hardness of computing recursive teaching dimension ⋮ On log-time alternating Turing machines of alternation depth k ⋮ On the kernel and related problems in interval digraphs ⋮ Gehrlein stable committee with multi-modal preferences ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ The Bounded and Precise Word Problems for Presentations of Groups ⋮ Hardness of subgraph and supergraph problems in \(c\)-tournaments ⋮ The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments ⋮ Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions ⋮ Domination in tournaments ⋮ The complexity of path-based defeasible inheritance ⋮ On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs ⋮ Results on learnability and the Vapnik-Chervonenkis dimension ⋮ Margin of victory for tournament solutions ⋮ Domination and location in twin-free digraphs ⋮ Finding kings in tournaments ⋮ Regular tournaments with minimum split domination number and cycle extendability ⋮ Condorcet winning sets ⋮ The inapproximability of non-NP-hard optimization problems.
Cites Work
This page was built for publication: On finding a minimum dominating set in a tournament
