Image de couverture de livre

A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chambers, Erin Wolf, Munch, Elizabeth, Percival, Sarah, Wang, Xinyi
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Computational Geometry General Topology
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Bounding the Interleaving Distance for Mapper Graphs with a Loss Function
par: Chambers, Erin W., et autres
Publié: (2023)

Relating Interleaving and Fréchet Distances via Ordered Merge Trees
par: Beurskens, Thijs, et autres
Publié: (2023)

An Improved FPT Algorithm for Computing the Interleaving Distance between Merge Trees via Path-Preserving Maps
par: P V, Althaf, et autres
Publié: (2026)

Scalable Exact Hierarchical Agglomerative Clustering via Sparse Geographic Distance Graphs
par: Maus, Victor, et autres
Publié: (2026)

The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
par: Munch, Elizabeth, et autres
Publié: (2025)

Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs
par: Chambers, Erin Wolf, et autres
Publié: (2025)

Improved Algorithms for Distance Selection and Related Problems
par: Wang, Haitao, et autres
Publié: (2023)

Compressed data structures for Heegaard splittings
par: Ennes, Henrique, et autres
Publié: (2025)

Fréchet Distance in Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2024)

Even Faster Algorithm for the Chamfer Distance
par: Feng, Ying, et autres
Publié: (2025)

Algorithms for Distance Problems in Continuous Graphs
par: Cabello, Sergio, et autres
Publié: (2025)

On the Complexity of the Ordered Covering Problem in Distance Geometry
par: Souza, Michael, et autres
Publié: (2025)

Data Structures for Approximate Discrete Fréchet Distance
par: van der Hoog, Ivor, et autres
Publié: (2022)

Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
par: Cheng, Siu-Wing, et autres
Publié: (2025)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
par: Conradi, Jacobus, et autres
Publié: (2026)

On Practical Nearest Sub-Trajectory Queries under the Fréchet Distance
par: Gudmundsson, Joachim, et autres
Publié: (2022)

Distance Approximating Minors for Planar and Minor-Free Graphs
par: Chang, Hsien-Chih, et autres
Publié: (2025)

Approximation Schemes for Subset TSP and Steiner Tree on Geometric Intersection Graphs
par: Kisfaludi-Bak, Sándor, et autres
Publié: (2026)

On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects
par: Bhore, Sujoy, et autres
Publié: (2025)

When Distances Lie: Euclidean Embeddings in the Presence of Outliers and Distance Violations
par: Bentert, Matthias, et autres
Publié: (2025)

Parameterized Geometric Graph Modification with Disk Scaling
par: Fomin, Fedor V., et autres
Publié: (2024)

Approximate Algorithms for Chamfer Distance Under Translation
par: Halevi, Gil, et autres
Publié: (2026)

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
par: Duraj, Lech, et autres
Publié: (2023)

Robust Algorithms for Path and Cycle Problems in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2025)

Small Independent Sets versus Small Separator in Geometric Intersection Graphs
par: Marin, Malory, et autres
Publié: (2026)

Charting the Diameter Computation Landscape of Geometric Intersection Graphs in Three Dimensions and Higher
par: Chan, Timothy M., et autres
Publié: (2026)

Optimal Distance Labeling for Permutation Graphs
par: Gawrychowski, Paweł, et autres
Publié: (2024)

Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
par: Dorfer, Joseph
Publié: (2026)

Algorithms for Euclidean Distance Matrix Completion: Exploiting Proximity to Triviality
par: Fomin, Fedor V., et autres
Publié: (2026)

Reconstructing Riemannian Metrics From Random Geometric Graphs
par: Huang, Han, et autres
Publié: (2025)

$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation
par: Greenhut, Daniel, et autres
Publié: (2025)

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

Unweighted Geometric Hitting Set for Line-Constrained Disks and Related Problems
par: Liu, Gang, et autres
Publié: (2024)

Enclosing Points with Geometric Objects
par: Chan, Timothy M., et autres
Publié: (2024)

Online Algorithms for Geometric Independent Set
par: De, Minati, et autres
Publié: (2026)

Range Counting Oracles for Geometric Problems
par: Driemel, Anne, et autres
Publié: (2025)

New aspects of quantum topological data analysis: Betti number estimation, and testing and tracking of homology and cohomology classes
par: Nghiem, Nhat A.
Publié: (2025)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
par: Neiman, Ofer, et autres
Publié: (2026)

Triangle Detection in Worst-Case Sparse Graphs via Local Sketching
par: Duan, Hongyi, et autres
Publié: (2025)

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