Image de couverture de livre

On the Expressibility of the Reconstructional Color Refinement

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Arvind, V., Köbler, Johannes, Verbitsky, Oleg
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity Discrete Mathematics Machine Learning Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Gathering Information about a Graph by Counting Walks from a Single Vertex
par: Fuhlbrück, Frank, et autres
Publié: (2024)

On a Hierarchy of Spectral Invariants for Graphs
par: Arvind, V., et autres
Publié: (2023)

Neural Networks and (Virtual) Extended Formulations
par: Hertrich, Christoph, et autres
Publié: (2024)

The Parameterized Complexity of Computing the VC-Dimension
par: Foucaud, Florent, et autres
Publié: (2025)

Arithmetic Circuits and Neural Networks for Regular Matroids
par: Hertrich, Christoph, et autres
Publié: (2025)

A Classification of Long-Refinement Graphs for Colour Refinement
par: Kiefer, Sandra, et autres
Publié: (2025)

The Computational Complexity of Counting Linear Regions in ReLU Neural Networks
par: Stargalla, Moritz, et autres
Publié: (2025)

Sparse High Dimensional Expanders via Local Lifts
par: Yaacov, Inbar Ben, et autres
Publié: (2024)

On full-separating sets and related codes in graphs
par: Chakraborty, Dipayan, et autres
Publié: (2024)

Chernoff Bounds and Reverse Hypercontractivity on HDX
par: Dikstein, Yotam, et autres
Publié: (2024)

Atropos-k is PSPACE-complete
par: Yang, Chao, et autres
Publié: (2024)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
par: Caragiannis, Ioannis, et autres
Publié: (2024)

Algorithmic methods of finite discrete structures. Graph clique problem
par: Kurapov, Sergey, et autres
Publié: (2024)

Complexity results for a cops and robber game on directed graphs
par: Ben-Ameur, Walid, et autres
Publié: (2024)

Equality cases of the Stanley--Yan log-concave matroid inequality
par: Chan, Swee Hong, et autres
Publié: (2024)

Bounded degree QBF and positional games
par: Oijid, Nacim
Publié: (2024)

A structural description of Zykov and Blanche Descartes graphs
par: Marin, Malory, et autres
Publié: (2024)

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
par: Bok, Jan, et autres
Publié: (2021)

Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
par: Nakajima, Tamio-Vesa, et autres
Publié: (2025)

Factorization norms and an inverse theorem for MaxCut
par: Balla, Igor, et autres
Publié: (2025)

Maker-Maker games of rank 4 are PSPACE-complete
par: Galliot, Florian, et autres
Publié: (2025)

Non-crossing $H$-graphs: a generalization of proper interval graphs admitting FPT algorithms
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Temporal Reachability Dominating Sets: contagion in temporal graphs
par: Kutner, David C., et autres
Publié: (2023)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
par: Chang, Fan, et autres
Publié: (2025)

Combinatorial refinement on circulant graphs
par: Kluge, Laurence
Publié: (2022)

Determining the Outerthickness of Graphs Is NP-Hard
par: Lee, Pin-Hsian, et autres
Publié: (2026)

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
par: Concha-Vega, Pablo
Publié: (2026)

Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes
par: Kopparty, Swastik, et autres
Publié: (2023)

Approximate cycle double cover
par: Ghanbari, Babak, et autres
Publié: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
par: Lucke, Felicia
Publié: (2025)

A Linear Kernel for Planar Vector Domination
par: Sahili, Mahabba El, et autres
Publié: (2023)

Finding Minimum Matching Cuts in $H$-free Graphs
par: Lucke, Felicia, et autres
Publié: (2025)

Finding d-Cuts in Claw-free Graphs
par: Ahn, Jungho, et autres
Publié: (2025)

Graph Irregularity via Edge Deletions
par: Bensmail, Julien, et autres
Publié: (2025)

Pseudorandomness of Expander Walks via Fourier Analysis on Groups
par: Jeronimo, Fernando Granha, et autres
Publié: (2025)

Reconfiguring Graph Homomorphisms on the Sphere
par: Lee, Jae-Baek, et autres
Publié: (2018)

Structural Origins of Cubic Complexity in Pebble Motion
par: Nakamigawa, Tomoki, et autres
Publié: (2025)

The Interplay Between Domination and Separation in Graphs
par: Chakraborty, Dipayan, et autres
Publié: (2026)

Hierarchies of Minion Tests for PCSPs through Tensors
par: Ciardo, Lorenzo, et autres
Publié: (2022)

On Computational Aspects of Ordered Matching Problems
par: Čertík, Michal, et autres
Publié: (2025)