Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (Q5370573): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Self-approaching Graphs / 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: Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3750120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for multicut and integral multiflow in rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal multicut and maximal integer multiflow: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric versions of the three-dimensional assignment problem under general norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing-Chord Graphs On Point Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-approaching curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a Polygon into Simpler Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Problem of Compatible Representatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On self-approaching and increasing-chord drawings of 3-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture related to geometric routing / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0218195917600068 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963776120 / rank
 
Normal rank

Latest revision as of 09:36, 30 July 2024

scientific article; zbMATH DE number 6794045
Language Label Description Also known as
English
Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
scientific article; zbMATH DE number 6794045

    Statements

    Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2017
    0 references
    greedy region decomposition
    0 references
    increasing-chord drawings
    0 references
    decomposing graph drawings
    0 references
    greedy routing in wireless sensor networks
    0 references

    Identifiers