- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1615-3383
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
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
- Urheber
-
Bauer, Ulrich
Landi, Claudia
Mémoli, Facundo
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10208-020-09488-3
- URN
-
urn:nbn:de:101:1-2021020119454298519336
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:31 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bauer, Ulrich
- Landi, Claudia
- Mémoli, Facundo
- SpringerLink (Online service)
Ähnliche Objekte (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
Embedding edit distance to enable private keyword search
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Secure approximation of edit distance on genomic data
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
Embedding edit distance to enable private keyword search
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance
Secure approximation of edit distance on genomic data
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
Embedding edit distance to enable private keyword search
Locality-sensitive bucketing functions for the edit distance
Algorithms for sparse convolution and sublinear edit distance