Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
Asymptotically optimal inapproximability of E k -SAT reconfiguration
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.
citing papers explorer
-
Adjacency labelling for proper minor-closed graph classes
Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
-
On (In)approximability of MaxMin Independent Set Reconfiguration
n/log n-approximation for MaxMin ISR on general graphs, polynomial-time approximation on degenerate graphs, FPT-AS on bounded-treewidth and H-minor-free graphs, plus inapproximability on bounded-degree, bandwidth n^{1/2+Θ(1)}, and bipartite graphs.