On \(k\)-greedy routing algorithms (Q283869): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.comgeo.2015.10.008 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68R10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6580909 / rank
 
Normal rank
Property / zbMATH Keywords
 
greedy routing
Property / zbMATH Keywords: greedy routing / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-greedy routing
Property / zbMATH Keywords: \(k\)-greedy routing / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-greedy drawing
Property / zbMATH Keywords: \(k\)-greedy drawing / rank
 
Normal rank
Property / zbMATH Keywords
 
plane graphs
Property / zbMATH Keywords: plane graphs / rank
 
Normal rank
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.comgeo.2015.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2202104035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm to Construct Greedy Drawings of Triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy drawings of triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Graph Drawing in the Hyperbolic Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4842716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Greedy Geometric Routing in the Euclidean Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Rectangular Duals of Planar Triangular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Floor-Plan of Plane Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on greedy embeddings in metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact floor-planning via orderly spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture related to geometric routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy routing via embedding graphs onto semi-metric spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved floor-planning of graphs via adjacency-preserving transformations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COMGEO.2015.10.008 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:22, 9 December 2024

scientific article
Language Label Description Also known as
English
On \(k\)-greedy routing algorithms
scientific article

    Statements

    Identifiers