Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs - MaRDI portal

A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (Q4557732)

From MaRDI portal
scientific article; zbMATH DE number 6984962
Language Label Description Also known as
English
A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs
scientific article; zbMATH DE number 6984962

    Statements

    title
    A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs (English)
    0 references
    author
    Fabrizio d'Amore
    0 references
    Paolo Giulio Franciosa
    0 references
    publication date
    26 November 2018
    0 references
    zbMATH Keywords
    robust computation
    0 references
    geometric graphs
    0 references
    Euclidean minimum spanning tree
    0 references
    arithmetic degree
    0 references
    cites work
    Q3948568
    0 references
    Q3140432
    0 references
    Q4948733
    0 references
    Q3992847
    0 references
    Q4821338
    0 references

    Identifiers

    zbMATH DE Number
    6984962
    0 references
    OpenAlex ID
    W2901754088
    0 references
    Wikidata QID
    Q128940224
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4557732&oldid=37585656"
    Powered by MediaWiki