Imagen de Portada

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Lee, Seoyong, Lee, Jinho
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Accurate and Fast Approximate Graph Pattern Mining at Scale
por: Arpaci-Dusseau, Anna, et al.
Publicado: (2024)

Resilient Pattern Mining
por: Bian, Pengxin, et al.
Publicado: (2025)

On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets
por: Ghoshal, Suprovat, et al.
Publicado: (2026)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
por: Li, Binhong, et al.
Publicado: (2025)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
por: Kolmogorov, Vladimir, et al.
Publicado: (2026)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
por: Fan, Chenglin, et al.
Publicado: (2025)

Approximate Circular Pattern Matching
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2022)

Contextual Pattern Mining and Counting
por: Li, Ling, et al.
Publicado: (2025)

1.64-Approximation for Chromatic Correlation Clustering via Chromatic Cluster LP
por: Lee, Dahoon, et al.
Publicado: (2025)

Fast Approximate Counting of Cycles
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

Scalable Order-Preserving Pattern Mining
por: Li, Ling, et al.
Publicado: (2024)

All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
por: Anand, Aditya, et al.
Publicado: (2025)

Fast Pattern Matching with Epsilon Transitions
por: Cotumaccio, Nicola
Publicado: (2025)

Approximating Small Sparse Cuts
por: Anand, Aditya, et al.
Publicado: (2024)

Tight Sampling Bounds for Eigenvalue Approximation
por: Swartworth, William, et al.
Publicado: (2024)

Approximate Circular Pattern Matching under Edit Distance
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2024)

Fast Sampling Based Sketches for Tensors
por: Swartworth, William, et al.
Publicado: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
por: Cruciani, Antonio, et al.
Publicado: (2025)

Enhanced Graph Pattern Matching
por: Cotumaccio, Nicola
Publicado: (2024)

Improved Approximation for Ranking on General Graphs
por: Derakhshan, Mahsa, et al.
Publicado: (2025)

Approximate Light Spanners in Planar Graphs
por: Le, Hung, et al.
Publicado: (2025)

Fast In-Spectrum Graph Watermarks
por: Bourrée, Jade Garcia, et al.
Publicado: (2025)

Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
por: Eden, Talya, et al.
Publicado: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
por: Neuwohner, Meike, et al.
Publicado: (2025)

On Incremental Approximate Shortest Paths in Directed Graphs
por: Górkiewicz, Adam, et al.
Publicado: (2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
por: Anand, Aditya, et al.
Publicado: (2025)

Breaching the 2 LMP Approximation Barrier for Facility Location with Applications to k-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2022)

Counting Patterns in Degenerate Graphs in Constant Space
por: Komarath, Balagopal, et al.
Publicado: (2025)

A $(2+\varepsilon)$-Approximation Algorithm for Metric $k$-Median
por: Cohen-Addad, Vincent, et al.
Publicado: (2025)

An Improved Greedy Approximation for (Metric) $k$-Means
por: Charikar, Moses, et al.
Publicado: (2026)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
por: Zhao, Jingyang, et al.
Publicado: (2025)

Approximation Algorithms for Packing Cycles and Paths in Complete Graphs
por: Zhao, Jingyang, et al.
Publicado: (2023)

Fast Algorithms for Graph Arboricity and Related Problems
por: Cen, Ruoxu, et al.
Publicado: (2025)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
por: Bansal, Nikhil, et al.
Publicado: (2026)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
por: Mallek, Nadym, et al.
Publicado: (2025)

Faster MPC Algorithms for Approximate Allocation in Uniformly Sparse Graphs
por: Łącki, Jakub, et al.
Publicado: (2025)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
por: Ashvinkumar, Vikrant, et al.
Publicado: (2024)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
por: Dogeas, Konstantinos, et al.
Publicado: (2023)

Approximating Queries on Probabilistic Graphs
por: Amarilli, Antoine, et al.
Publicado: (2023)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
por: Heck, Sophia, et al.
Publicado: (2026)