A generalized greedy routing algorithm for 2-connected graphs
type: Item
instance of: scholarly article
title: A generalized greedy routing algorithm for 2-connected graphs
zbMATH Open document ID: 1213.68474
author: Huaming Zhang
author: Xin He
published in: Theoretical Computer Science
publication date: 2010-11-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5817530
zbMATH Keywords: network routing
zbMATH Keywords: greedy routing
zbMATH Keywords: plane graph
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.08.032
OpenAlex ID: W2083079385
cites work: Succinct Greedy Drawings Do Not Always Exist
cites work: An Algorithm to Construct Greedy Drawings of Triangulations
cites work: Distributed computation of virtual coordinates
cites work: Routing with guaranteed delivery in ad hoc wireless networks
cites work: Q3579393
cites work: st-ordering the vertices of biconnected graphs
cites work: Succinct Greedy Graph Drawing in the Hyperbolic Plane
cites work: Computing an st-numbering
cites work: Bipolar orientations revisited
cites work: On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks
cites work: Transversal structures on triangulations: A combinatorial study and straight-line drawings
cites work: Succinct Greedy Geometric Routing in the Euclidean Plane
cites work: Geometric ad-hoc routing
cites work: Some results on greedy embeddings in metric spaces
cites work: Q5596083
cites work: On a conjecture related to geometric routing
DOI: 10.1016/J.TCS.2010.08.032
description: scientific article; zbMATH DE number 5817530