Copertina

A customizable inexact subgraph matching algorithm for attributed graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Benko, Tatyana, Jones, Rebecca, Tate, Lucas
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Finding sparse induced subgraphs on graphs of bounded induced matching treewidth
di: Bodlaender, Hans L., et al.
Pubblicazione: (2025)

Graph matching based on similarities in structure and attributes
di: Candelier, Raphaël
Pubblicazione: (2024)

Fair densest subgraph across multiple graphs
di: Arachchi, Chamalee Wickrama, et al.
Pubblicazione: (2025)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
di: Tsin, Yung H.
Pubblicazione: (2023)

QPTAS for MWIS and finding large sparse induced subgraphs in graphs with few independent long holes
di: Bonnet, Édouard, et al.
Pubblicazione: (2026)

Finding large sparse induced subgraphs in graphs of small (but not very small) tree-independence number
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2026)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
di: Jaberi, Raed, et al.
Pubblicazione: (2024)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
di: Chudnovsky, Maria, et al.
Pubblicazione: (2024)

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
di: An, Shinwoo, et al.
Pubblicazione: (2025)

Practical algorithms for Hierarchical overlap graphs
di: Talera, Saumya, et al.
Pubblicazione: (2024)

Testing whether a subgraph is convex or isometric
di: Cabello, Sergio
Pubblicazione: (2025)

Strassen's algorithm via orbit flip graphs
di: Ikenmeyer, Christian, et al.
Pubblicazione: (2025)

An $O(n^3)$ time algorithm for the maximum-weight limited-capacity many-to-many matching
di: Rajabi-Alni, Fatemeh, et al.
Pubblicazione: (2014)

Faster algorithms for packing forests in graphs and related problems
di: Arkhipov, Pavel, et al.
Pubblicazione: (2024)

OptiRefine: Densest subgraphs and maximum cuts with $k$ refinements
di: Tu, Sijing, et al.
Pubblicazione: (2025)

Cover time of random subgraphs of the hypercube
di: Cooper, Colin, et al.
Pubblicazione: (2025)

Compression with wildcards: All induced metric subgraphs
di: Wild, Marcel
Pubblicazione: (2024)

An algorithm with a delay of $\mathcal{O}(kΔ)$ for enumerating connected induced subgraphs of size $k$
di: Xiao, Chenglong, et al.
Pubblicazione: (2024)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
di: Grigoriev, Alexander, et al.
Pubblicazione: (2025)

Finding maximum matchings in RDV graphs efficiently
di: Biedl, Therese, et al.
Pubblicazione: (2024)

Reconfiguration of labeled matchings in triangular grid graphs
di: Kakimura, Naonori, et al.
Pubblicazione: (2024)

Reconstruction of geometric random graphs with the Simple algorithm
di: Stegehuis, Clara, et al.
Pubblicazione: (2024)

Identifying bubble-like subgraphs in linear-time via a unified SPQR-tree framework
di: Sena, Francisco, et al.
Pubblicazione: (2026)

A more efficient algorithm to compute the Rand Index for change-point problems
di: Prates, Lucas de Oliveira
Pubblicazione: (2021)

Comparative genomics with succinct colored de Bruijn graphs
di: Ramos, Lucas P., et al.
Pubblicazione: (2024)

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

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
di: Lecroq, Thierry
Pubblicazione: (2024)

Online matching on stochastic block model
di: Cherifa, Maria, et al.
Pubblicazione: (2025)

Suffix sorting via matching statistics
di: Lipták, Zsuzsanna, et al.
Pubblicazione: (2022)

Dynamic online matching with budget refills
di: Cherifa, Maria, et al.
Pubblicazione: (2024)

The Canadian Traveller Problem on outerplanar graphs
di: Beaudou, Laurent, et al.
Pubblicazione: (2024)

A framework for boosting matching approximation: parallel, distributed, and dynamic
di: Mitrović, Slobodan, et al.
Pubblicazione: (2025)

Dynamic algorithms for k-center on graphs
di: Cruciani, Emilio, et al.
Pubblicazione: (2023)

Online matching games in bipartite expanders and applications
di: Bauwens, Bruno, et al.
Pubblicazione: (2022)

Counting perfect matchings and Hamiltonian cycles faster
di: Li, Baitian
Pubblicazione: (2023)

Online matching with delays and stochastic arrival times
di: Mari, Mathieu, et al.
Pubblicazione: (2022)

Reconstructing Sets of Strings from Their k-way Projections: Algorithms & Complexity
di: Tate, Elise, et al.
Pubblicazione: (2025)

Clique-free t-matchings in degree-bounded graphs
di: Paluch, Katarzyna, et al.
Pubblicazione: (2024)

Computing maximal palindromes in non-standard matching models
di: Mieno, Takuya, et al.
Pubblicazione: (2022)