Develops O*(3^{n/3}) enumeration for preferred extensions in general digraphs and O(1.2321^n) for oriented graphs using a new 2-stage sampling algorithm combined with monotone local search.
Generating functions for ker- nels of digraphs (enumeration & asymptotics for a constrain t from game theory)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Enumeration of Preferred Extensions in Almost Oriented Digraphs
Develops O*(3^{n/3}) enumeration for preferred extensions in general digraphs and O(1.2321^n) for oriented graphs using a new 2-stage sampling algorithm combined with monotone local search.