Image de couverture de livre

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kothalawala, Buddhi, Koehler, Henning, Farhan, Muhammad
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Optimized Customizable Route Planning in Large Road Networks with Batch Processing
par: Farhan, Muhammad, et autres
Publié: (2026)

Stable Tree Labelling for Accelerating Distance Queries on Dynamic Road Networks
par: Koehler, Henning, et autres
Publié: (2025)

Dual-Hierarchy Labelling: Scaling Up Distance Queries on Dynamic Road Networks
par: Farhan, Muhammad, et autres
Publié: (2025)

Finding a Maximum Common (Induced) Subgraph: Structural Parameters Revisited
par: Hanaka, Tesshu, et autres
Publié: (2025)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

Parameterized Complexity of Finding a Maximum Common Vertex Subgraph Without Isolated Vertices
par: Dey, Palash, et autres
Publié: (2026)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
par: Zhou, Yi, et autres
Publié: (2025)

On Finding All Connected Maximum-Sized Common Subgraphs in Multiple Labeled Graphs
par: Petersen, Johannes B. S., et autres
Publié: (2025)

Acceleration for Distributed Transshipment and Parallel Maximum Flow
par: Grunau, Christoph, et autres
Publié: (2025)

Finding Order-Preserving Subgraphs
par: Imamura, Haruya, et autres
Publié: (2025)

Forbidden Subgraph Problems with Predictions
par: Böckenhauer, Hans-Joachim, et autres
Publié: (2025)

Destroying Densest Subgraphs is Hard
par: Bazgan, Cristina, et autres
Publié: (2024)

Exploiting New Properties of String Net Frequency for Efficient Computation
par: Guo, Peaker, et autres
Publié: (2024)

Packing Compact Subgraphs with Applications to Districting
par: Chen, Ho-Lin, et autres
Publié: (2026)

Counting Cohesive Subgraphs with Hereditary Properties
par: Li, Rong-Hua, et autres
Publié: (2024)

Finding Small Complete Subgraphs Efficiently
par: Chen, Ke, et autres
Publié: (2023)

Subexponential Parameterized Algorithms for Hitting Subgraphs
par: Lokshtanov, Daniel, et autres
Publié: (2024)

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
par: Çivril, Ali
Publié: (2023)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
par: Chang, Yi-Jun, et autres
Publié: (2024)

Scalable $k$-clique Densest Subgraph Search
par: Ye, Xiaowei, et autres
Publié: (2024)

Finding Maximum Common Contractions Between Phylogenetic Networks
par: Marchand, Bertrand, et autres
Publié: (2024)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
par: Mitrović, Slobodan, et autres
Publié: (2025)

Dense Subgraph Discovery Meets Strong Triadic Closure
par: Arachchi, Chamalee Wickrama, et autres
Publié: (2025)

Almost Tight Bounds for Differentially Private Densest Subgraph
par: Dinitz, Michael, et autres
Publié: (2023)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
par: DeHaan, Ian, et autres
Publié: (2024)

Better Decremental and Fully Dynamic Sensitivity Oracles for Subgraph Connectivity
par: Long, Yaowei, et autres
Publié: (2024)

Finding Induced Subgraphs from Graphs with Small Mim-Width
par: Otachi, Yota, et autres
Publié: (2024)

$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations
par: Wang, Yulun, et autres
Publié: (2025)

Changing Induced Subgraph Isomorphisms Under Extended Reconfiguration Rules
par: Suga, Tatsuhiro, et autres
Publié: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
par: Saller, Sophia, et autres
Publié: (2023)

An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
par: Xu, Xiaojia, et autres
Publié: (2024)

A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
par: Bringmann, Karl, et autres
Publié: (2024)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
par: Hochbaum, Dorit S., et autres
Publié: (2025)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
par: Nguyen, Ta Duy, et autres
Publié: (2024)

Compact Conformal Subgraphs
par: Gollapudi, Sreenivas, et autres
Publié: (2026)

Maximum And- vs. Even-SAT
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

Unweighted One-Sided Code Sparsifiers and Thin Subgraphs
par: Gharan, Shayan Oveis, et autres
Publié: (2025)

Computing Maximum Cliques in Unit Disk Graphs
par: Tkachenko, Anastasiia, et autres
Publié: (2025)

Towards practical FPRAS for #NFA: Exploiting the Power of Dependence
par: Meel, Kuldeep S., et autres
Publié: (2025)