Image de couverture de livre

The Complexity of Homomorphism Reconstruction Revisited

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Gervens, Timo, Grohe, Martin, Härtel, Louis, Fonseca, Philipp da Silva
Format:	Preprint
Publié:	2026
Sujets:	Discrete Mathematics Data Structures and Algorithms Combinatorics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

The Strong Birthday Problem Revisited
par: Tripathy, Chijul B.
Publié: (2025)

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

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Unsplittable Transshipments
par: Debgupta, Srinwanti, et autres
Publié: (2026)

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

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
par: Dahan, Anatole, et autres
Publié: (2026)

Vigemers: on the number of $k$-mers sharing the same XOR-based minimizer
par: Ingels, Florian, et autres
Publié: (2026)

Induced Cycles of Many Lengths
par: Chudnovsky, Maria, et autres
Publié: (2026)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
par: Deák, Bence, et autres
Publié: (2026)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
par: Srinivasan, Eshwar, et autres
Publié: (2026)

Generating minimal redundant and maximal irredundant sets in incidence graphs
par: Castelo, Emanuel, et autres
Publié: (2026)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

EPTAS for Hard Graph Cut Problems for Dense Graphs
par: Deguchi, Kaisei, et autres
Publié: (2026)

Hardness of Burning Number Problem on Regular Graphs
par: Antony, Dhanyamol, et autres
Publié: (2026)

Non-Additive Discrepancy: Coverage Functions in a Beck-Fiala Setting
par: Avila, Tatiana Rocha, et autres
Publié: (2026)

Coarse Balanced Separators in Fat-Minor-Free Graphs
par: Bonnet, Édouard, et autres
Publié: (2026)

Moderately beyond clique-width: reduced component max-leaf and related parameters
par: Bonnet, Édouard, et autres
Publié: (2026)

Variants of Merge-Width and Applications
par: Drabik, Karolina, et autres
Publié: (2026)

Induced Minors and Coarse Tree Decompositions
par: Chudnovsky, Maria, et autres
Publié: (2026)

Designing sparse temporal graphs satisfying connectivity requirements
par: Bellitto, Thomas, et autres
Publié: (2026)

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
par: von Bergen, Hanno, et autres
Publié: (2026)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
par: Ghanbari, Babak, et autres
Publié: (2026)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
par: Bencs, Ferenc, et autres
Publié: (2024)

Reconfiguration of List Colourings
par: Cambie, Stijn, et autres
Publié: (2025)

Parameterized complexity of isometric path partition: treewidth and diameter
par: Chakraborty, Dibyayan, et autres
Publié: (2025)

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
par: Ghanbari, Babak, et autres
Publié: (2025)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
par: Torres, Ethan, et autres
Publié: (2025)

Approximating maximum-size properly colored forests
par: Bai, Yuhang, et autres
Publié: (2024)

Problems on Group-labeled Matroid Bases
par: Hörsch, Florian, et autres
Publié: (2024)

$α_i$-Metric Graphs: Hyperbolicity
par: Dragan, Feodor F., et autres
Publié: (2024)

Rainbow Arborescence Conjecture
par: Bérczi, Kristóf, et autres
Publié: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
par: An, Shinwoo, et autres
Publié: (2025)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
par: Holtgrefe, Niels, et autres
Publié: (2024)

Cuts in Graphs with Matroid Constraints
par: Banik, Aritra, et autres
Publié: (2024)

Optimal and Efficient Partite Decompositions of Hypergraphs
par: Krapivin, Andrew, et autres
Publié: (2025)

Matrix Scaling: a New Heuristic for the Feedback Vertex Set Problem
par: Shook, James M., et autres
Publié: (2025)

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

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
par: Dudeja, Aditi, et autres
Publié: (2024)

Deterministic approximation for the volume of the truncated fractional matching polytope
par: Guo, Heng, et autres
Publié: (2024)