Skip to main content

4 Result(s)

within Jaroslav Opatrny Remove this filter Algorithms Remove this filter Data Structures Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks

    An important technique for discovering routes between two nodes in an ad-hoc network involves applying the face routing algorithm on a planar spanner of the network. Face routing guarantees message delivery in...

    Paul Boone, Edgar Chavez, Lev Gleitzky… in Structural Information and Communication C… (2004)

  2. No Access

    Chapter and Conference Paper

    Two-Hop Virtual Path Layout in Tori

    We consider the problem of D-hop virtual path layout in ATM (Asynchronous Transfer Mode) networks. Given a physical network and an all-to-all traffic pattern, the problem consists of designing a virtual network w...

    Sébastien Choplin, Lata Narayanan… in Structural Information and Communication C… (2004)

  3. No Access

    Chapter and Conference Paper

    Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs

    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 that for some positive integers l,

    Jurek Czyzowicz, Stefan Dobrev… in Structural Information and Communication C… (2007)

  4. No Access

    Chapter and Conference Paper

    Distributed Barrier Coverage with Relocatable Sensors

    A wireless sensor can detect the presence of an intruder in its sensing range, and is said to cover the portion of a given barrier that intersects with its sensing range. Barrier coverage is achieved by a set ...

    Mohsen Eftekhari, Paola Flocchini… in Structural Information and Communication C… (2014)