Constant memory routing in quasi-planar and quasi-polyhedral graphs (Q1003732): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2008.01.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061436084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Information and Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472479 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE / 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: Algorithmic Aspects of Wireless Sensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric ad-hoc routing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 02:37, 29 June 2024

scientific article
Language Label Description Also known as
English
Constant memory routing in quasi-planar and quasi-polyhedral graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references