Every proper minor-closed graph class admits an optimal (1+o(1)) log n bit adjacency labeling scheme.
Title resolution pending
10 Pith papers cite this work. Polarity classification is still indexing.
10
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 10roles
background 1polarities
background 1representative citing papers
Introduces exact and FPT algorithms for computing the scanwidth of DAGs and phylogenetic networks, plus a heuristic with good practical performance.
Introduces an epistemic framework for causality in Byzantine multi-agent systems and identifies the multipede communication structure needed to verify action preconditions under faults.
Verifies stronger coarse balanced separator conjecture for all r in K_{t,t}-induced-minor-free graphs of bounded clique number via a polynomial-size hitting set Z for large balls on any Y.
Eulerian directed graphs of bounded carving width are well-quasi-ordered by strong immersion, with a meta-theorem extending to labeled vertices and edge orderings.
RLGT is a modular reinforcement learning framework for extremal graph theory that handles undirected, directed, looped, and multi-colored graphs to facilitate future research.
Establishes PSPACE-completeness of (d,k)-Coloring Reconfiguration for d>=2 on multiple restricted graph classes and a quadratic-time algorithm on paths.
Faster FPT algorithms for Telephone Broadcast achieve 2^{O(vc log vc)}, 2^{O(vi^2 log vi)}, and 2^{O(k log k)} n^{O(1)} time via reduction to b-Matching.
Complements of Manin-Schechtman arrangements have non-vanishing higher homotopy groups and are therefore not K(π,1) spaces in a broad range of cases.
O(n log n) algorithm renders unit circular arc intersection graphs edgeless and k-clique-free; GGED is strongly NP-hard on unweighted interval graphs and on d-balls/d-cubes for d >= 2.
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.
-
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
Eulerian directed graphs of bounded carving width are well-quasi-ordered by strong immersion, with a meta-theorem extending to labeled vertices and edge orderings.