Sciweavers

    2 search results - page 1 / 1
    » Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Grap...
    Sort
    View
    SIROCCO
    2007
    143views Information Technology» more  SIROCCO 2007»
    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
    13 years 6 months ago
    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
    Download  www.matem.unam.mx
    The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
    Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...
    claim paper
    Read More »
    IM
    2008
    162views Computer Networks» more  IM 2008»
    Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
    13 years 4 months ago
    Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
    Download  web.sau.edu
    Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
    Chen Avin
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.