- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1615-3383
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The Reeb Graph Edit Distance is Universal ; day:29 ; month:12 ; year:2020 ; pages:1-24
Foundations of computational mathematics ; (29.12.2020), 1-24
- Creator
-
Bauer, Ulrich
Landi, Claudia
Mémoli, Facundo
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10208-020-09488-3
- URN
-
urn:nbn:de:101:1-2021020119454298519336
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:31 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bauer, Ulrich
- Landi, Claudia
- Mémoli, Facundo
- SpringerLink (Online service)
Other Objects (12)
Redefining the Graph Edit Distance
Computing graph edit distance on quantum devices
Exact and heuristic algorithms for network alignment using graph edit distance models
Poincaré–Reeb graphs of real algebraic domains
Reeb
Quantitative monitoring of STL with edit distance
Distance-regular graphs
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Redefining the Graph Edit Distance
Computing graph edit distance on quantum devices
Exact and heuristic algorithms for network alignment using graph edit distance models
Poincaré–Reeb graphs of real algebraic domains
Reeb
Quantitative monitoring of STL with edit distance
Distance-regular graphs
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search
k-Approximate Quasiperiodicity Under Hamming and Edit Distance
Redefining the Graph Edit Distance
Computing graph edit distance on quantum devices
Exact and heuristic algorithms for network alignment using graph edit distance models
Poincaré–Reeb graphs of real algebraic domains
Reeb
Quantitative monitoring of STL with edit distance
Distance-regular graphs
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Embedding edit distance to enable private keyword search