Pages that link to "Item:Q1113678"
From MaRDI portal
The following pages link to On finding a minimum dominating set in a tournament (Q1113678):
Displaying 25 items.
- Minimal stable sets in tournaments (Q634517) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions (Q674405) (← links)
- The complexity of path-based defeasible inheritance (Q685542) (← links)
- Results on learnability and the Vapnik-Chervonenkis dimension (Q751859) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs (Q1007577) (← links)
- Domination and fractional domination in digraphs (Q1671654) (← links)
- Domination in tournaments (Q1745734) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Finding kings in tournaments (Q2081490) (← links)
- Regular tournaments with minimum split domination number and cycle extendability (Q2089539) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
- Condorcet winning sets (Q2341123) (← links)
- Absorbant of generalized de Bruijn digraphs (Q2380030) (← links)
- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533) (← links)
- (Q4472696) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- The Bounded and Precise Word Problems for Presentations of Groups (Q5113919) (← links)
- Quasipolynomiality of the Smallest Missing Induced Subgraph (Q6051910) (← links)
- A note on hardness of computing recursive teaching dimension (Q6072213) (← links)
- On log-time alternating Turing machines of alternation depth k (Q6085715) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)
- Gehrlein stable committee with multi-modal preferences (Q6109543) (← links)
