The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
16 Guillaume Ducoffe, Michel Habib, and Laurent Viennot
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Conditional lower bound rules out O(n^{2-ε}) algorithms for isometric/convex subgraph testing on sparse graphs; subquadratic time for planar graphs and near-linear time for bounded-treewidth and certain plane graphs.
citing papers explorer
-
The Normal Domination Partizan Game in Stars
The winner of the normal partizan domination game is determined for complete split graphs including star forests under arbitrary initial colorings.
-
Testing whether a subgraph is convex or isometric
Conditional lower bound rules out O(n^{2-ε}) algorithms for isometric/convex subgraph testing on sparse graphs; subquadratic time for planar graphs and near-linear time for bounded-treewidth and certain plane graphs.