Image de couverture de livre

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dahan, Anatole, Grohe, Martin, Neuen, Daniel, Novotný, Tomáš
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

A Faster Isomorphism Test for Graphs of Small Degree
par: Grohe, Martin, et autres
Publié: (2018)

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
par: Neuen, Daniel
Publié: (2020)

Isomorphism Testing Parameterized by Genus and Beyond
par: Neuen, Daniel
Publié: (2021)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
par: Grohe, Martin, et autres
Publié: (2023)

The Iteration Number of the Weisfeiler-Leman Algorithm
par: Grohe, Martin, et autres
Publié: (2023)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
par: Bandyapadhyay, Sayan, et autres
Publié: (2024)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
par: Ingels, Florian
Publié: (2023)

The Complexity of Homomorphism Reconstruction Revisited
par: Gervens, Timo, et autres
Publié: (2026)

Greediness is not always a vice: Efficient Discovery Algorithms for Assignment Problems
par: Duvignau, Romaric, et autres
Publié: (2024)

The Role of Dimension in the Online Chasing Problem
par: Papazov, Hristo
Publié: (2023)

A Lower Bound on the Competitive Ratio of the Permutation Algorithm for Online Facility Assignment on a Line
par: Harada, Tsubasa
Publié: (2024)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2024)

Graph Visualization for Blockchain Data
par: Dietl, Marcell, et autres
Publié: (2024)

Breaking Hard Isomorphism Benchmarks with DRESS
par: Velilla, Eduar Castrillo
Publié: (2026)

Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
par: Marx, Dániel, et autres
Publié: (2026)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
par: Jana, Satyabrata, et autres
Publié: (2025)

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
par: Paul-Pena, Daniel, et autres
Publié: (2022)

Online Graph Coloring for $k$-Colorable Graphs
par: Kawarabayashi, Ken-ichi, et autres
Publié: (2025)

Stability in Graphs with Matroid Constraints
par: Fomin, Fedor V., et autres
Publié: (2024)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

Temporal Graph Realization With Bounded Stretch
par: Mertzios, George B., et autres
Publié: (2025)

Triangle Detection in H-Free Graphs
par: Abboud, Amir, et autres
Publié: (2025)

Placing Green Bridges Optimally for Robust Habitat Reconnection
par: Ellmies, Gero, et autres
Publié: (2026)

Online Graph Balancing and the Power of Two Choices
par: Bansal, Nikhil, et autres
Publié: (2026)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

FO and MSO Model Checking on Temporal Graphs
par: Döring, Michelle, et autres
Publié: (2026)

Optimal Padded Decomposition For Bounded Treewidth Graphs
par: Filtser, Arnold, et autres
Publié: (2024)

Exponential Time Approximation for Coloring 3-Colorable Graphs
par: Guruswami, Venkatesan, et autres
Publié: (2024)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)

Approximating Maximum Edge 2-Coloring by Normalizing Graphs
par: Mömke, Tobias, et autres
Publié: (2024)

Tight Paths and Tight Pairs in Weighted Directed Graphs
par: Balcázar, José Luis
Publié: (2025)

Algorithmic Results for Weak Roman Domination Problem in Graphs
par: Paul, Kaustav, et autres
Publié: (2024)

Efficient Algorithms for Interdicting Facilities in Trees and Bounded Treewidth Graphs
par: Abbasi, Ali, et autres
Publié: (2026)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
par: Wang, Chen, et autres
Publié: (2024)

(Almost-)Optimal FPT Algorithm and Kernel for $T$-Cycle on Planar Graphs
par: Gahlawat, Harmender, et autres
Publié: (2025)

A Finer View of the Parameterized Landscape of Labeled Graph Contractions
par: Mathur, Yashaswini, et autres
Publié: (2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
par: Beisegel, Jesse, et autres
Publié: (2025)

Colouring Probe $H$-Free Graphs
par: Paulusma, Daniël, et autres
Publié: (2025)