Imagen de Portada

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Petersen, Johannes B. S., Davoodi, Akbar, Gärtner, Thomas, Hellmuth, Marc, Merkle, Daniel
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics Molecular Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Solving NP-hard Problems on \textsc{GaTEx} Graphs: Linear-Time Algorithms for Perfect Orderings, Cliques, Colorings, and Independent Sets
por: Hellmuth, Marc, et al.
Publicado: (2023)

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

Isomorphism Testing for Graphs Excluding Small Topological Subgraphs
por: Neuen, Daniel
Publicado: (2020)

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

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

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)

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

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

On The Maximum Linear Arrangement Problem for Trees
por: Alemany-Puig, Lluís, et al.
Publicado: (2023)

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

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

Linear-Sized Spectral Sparsifiers and the Kadison-Singer Problem
por: Paschalidis, Phevos, et al.
Publicado: (2023)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
por: Kita, Nanano
Publicado: (2025)

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)

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

Finding $d$-Cuts in Probe $H$-Free Graphs
por: Dabrowski, Konrad K., et al.
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)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., 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)

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)

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

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

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

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

The Gap Between Greedy Algorithm and Minimum Multiplicative Spanner
por: Chen, Yeyuan
Publicado: (2024)

Designing sparse temporal graphs satisfying connectivity requirements
por: Bellitto, Thomas, et al.
Publicado: (2026)

Computing Subset Vertex Covers in $H$-Free Graphs
por: Brettell, Nick, et al.
Publicado: (2023)

A Method for Generating Connected Erdos-Renyi Random Graphs
por: Chinyaev, Boris
Publicado: (2025)

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

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
por: Lucke, Felicia, et al.
Publicado: (2023)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
por: Bencs, Ferenc, et al.
Publicado: (2024)

The Strong Birthday Problem Revisited
por: Tripathy, Chijul B.
Publicado: (2025)