LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (Q5189993): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q215100
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Evangelos Kranakis / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the four color theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with guaranteed delivery in ad hoc wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locality in Distributed Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple heuristics for unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stretch Factor of Euclidean Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local solutions for global problems in wireless networks / rank
 
Normal rank

Latest revision as of 13:46, 2 July 2024

scientific article; zbMATH DE number 5680916
Language Label Description Also known as
English
LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS
scientific article; zbMATH DE number 5680916

    Statements

    LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS (English)
    0 references
    0 references
    0 references
    11 March 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    local algorithms
    0 references
    unit disk graphs
    0 references
    approximation algorithms
    0 references
    spanner
    0 references
    coloring
    0 references