The size of minimal excluded minors for a surface of genus g is O(g^{8+ε}).
13 Umit Catalyurek and Cevdet Aykanat
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Proves NP- and ΣP2-completeness for variants of a graph game modeling defender controller placement against vertex attacks, with polynomial algorithms for interval graphs and bounded treewidth.
ReBaHFC refines PaToH outputs with the new HyperFlowCutter flow algorithm to deliver hypergraph bipartition quality close to KaHyPar and hMETIS while running an order of magnitude faster.
citing papers explorer
-
A polynomial bound for the minimal excluded minors for a surface
The size of minimal excluded minors for a surface of genus g is O(g^{8+ε}).
-
Modelling Network Resilience: The Complexity of Some Graph Division Games
Proves NP- and ΣP2-completeness for variants of a graph game modeling defender controller placement against vertex attacks, with polynomial algorithms for interval graphs and bounded treewidth.
-
Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm
ReBaHFC refines PaToH outputs with the new HyperFlowCutter flow algorithm to deliver hypergraph bipartition quality close to KaHyPar and hMETIS while running an order of magnitude faster.