Distance measures for embedded graphs (Q1984601): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3118880490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Gromov-Hausdorff Distance for Metric Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map Construction Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Street Networks from GPS Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching planar maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4886099 / rank
 
Normal rank

Latest revision as of 15:57, 26 July 2024

scientific article
Language Label Description Also known as
English
Distance measures for embedded graphs
scientific article

    Statements

    Distance measures for embedded graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    16 September 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    Fréchet distance
    0 references
    graph comparison
    0 references
    embedded graphs
    0 references
    0 references