Imagen de Portada

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Neuen, Daniel
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Isomorphism Testing Parameterized by Genus and Beyond
por: Neuen, Daniel
Publicado: (2021)

A Faster Isomorphism Test for Graphs of Small Degree
por: Grohe, Martin, et al.
Publicado: (2018)

Isomorphism for Tournaments of Small Twin Width
por: Grohe, Martin, et al.
Publicado: (2023)

Robust Graph Isomorphism, Quadratic Assignment and VC Dimension
por: Dahan, Anatole, et al.
Publicado: (2026)

Robust Contraction Decomposition for Minor-Free Graphs and its Applications
por: Bandyapadhyay, Sayan, et al.
Publicado: (2024)

Steiner Forest for $H$-Subgraph-Free Graphs
por: Eagling-Vose, Tala, et al.
Publicado: (2026)

A Fast Algorithm for Finding Minimum Weight Cycles in Mining Cyclic Graph Topologies
por: Shakeri, Heman, et al.
Publicado: (2025)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
por: Petersen, Johannes B. S., et al.
Publicado: (2025)

Colouring Probe $H$-Free Graphs
por: Paulusma, Daniël, et al.
Publicado: (2025)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

Tree Independence Number IV. Even-hole-free Graphs
por: Chudnovsky, Maria, et al.
Publicado: (2024)

EPTAS for Hard Graph Cut Problems for Dense Graphs
por: Deguchi, Kaisei, et al.
Publicado: (2026)

Extending Ghouila-Houri's Characterization of Comparability Graphs to Temporal Graphs
por: Charbit, Pierre, et al.
Publicado: (2025)

Computational Verification of the Buratti--Horak--Rosa Conjecture for Small Integers and Inductive Approaches
por: Naik, Ranjan N
Publicado: (2025)

Cuts in Graphs with Matroid Constraints
por: Banik, Aritra, et al.
Publicado: (2024)

$α_i$-Metric Graphs: Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

Palette Sparsification for Graphs with Sparse Neighborhoods
por: Dhawan, Abhishek
Publicado: (2024)

Hardness of Burning Number Problem on Regular Graphs
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Light Edge Fault Tolerant Graph Spanners
por: Bodwin, Greg, et al.
Publicado: (2025)

Sandwich Monotonicity and the Recognition of Weighted Graph Classes
por: Beisegel, Jesse, et al.
Publicado: (2025)

Graph parameters that are coarsely equivalent to path-length
por: Dragan, Feodor F., et al.
Publicado: (2025)

Directed Hypercube Routing, a Generalized Lehman-Ron Theorem, and Monotonicity Testing
por: Chakrabarty, Deeparnab, et al.
Publicado: (2024)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
por: Holtgrefe, Niels, et al.
Publicado: (2024)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)

Weighted Clique and Independent Set in Edge-Distant Hereditary Graphs
por: Srinivasan, Eshwar, et al.
Publicado: (2026)

Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
por: Paul-Pena, Daniel, et al.
Publicado: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Randomized Greedy Online Edge Coloring Succeeds for Dense and Randomly-Ordered Graphs
por: Dudeja, Aditi, et al.
Publicado: (2024)

A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs
por: Ghanbari, Babak, et al.
Publicado: (2026)

Holey graphs: very large Betti numbers are testable
por: Szabó, Dániel, et al.
Publicado: (2024)

Efficient Algorithms and Implementations for Extracting Maximum-Size $(k,\ell)$-Sparse Subgraphs
por: Madarasi, Péter
Publicado: (2025)

Quadratic-Time Algorithm for the Maximum-Weight $(k, \ell)$-Sparse Subgraph Problem
por: Deák, Bence, et al.
Publicado: (2025)

Induced Minors and Coarse Tree Decompositions
por: Chudnovsky, Maria, et al.
Publicado: (2026)

A Quadratic Vertex Kernel and a Subexponential Algorithm for Subset-FAST
por: Jana, Satyabrata, et al.
Publicado: (2025)

A Uniformly Random Solution to Algorithmic Redistricting
por: Cai, Jin-Yi, et al.
Publicado: (2024)

Reconfiguration of List Colourings
por: Cambie, Stijn, et al.
Publicado: (2025)

Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery
por: von Bergen, Hanno, et al.
Publicado: (2026)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
por: Lucke, Felicia, et al.
Publicado: (2024)

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs
por: Gamarnik, David, et al.
Publicado: (2026)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)