Comparing Graphs via Persistence Distortion
From MaRDI portal
Publication:5368708
DOI10.4230/LIPIcs.SOCG.2015.491zbMath1378.05037arXiv1503.07414OpenAlexW1511069251MaRDI QIDQ5368708
Yusu Wang, Dayu Shi, Tamal Krishna Dey
Publication date: 10 October 2017
Full work available at URL: https://arxiv.org/abs/1503.07414
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
The fiber of persistent homology for simplicial complexes ⋮ New families of stable simplicial filtration functors ⋮ Inverse Problems in Topological Persistence ⋮ Local versus global distances for zigzag and multi-parameter persistence modules ⋮ Decorated merge trees for persistent topology
This page was built for publication: Comparing Graphs via Persistence Distortion
