𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Functional equations for planar graphs

✍ Scribed by I.Ya. Aref'eva

Book ID
113343763
Publisher
Elsevier Science
Year
1981
Tongue
English
Weight
227 KB
Volume
104
Category
Article
ISSN
0370-2693

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorial curvature for planar graph
Combinatorial curvature for planar graphs
✍ Yusuke Higuchi πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 113 KB

## Abstract Regarding an infinite planar graph __G__ as a discrete analogue of a noncompact simply connected Riemannian surface, we introduce the combinatorial curvature of __G__ corresponding to the sectional curvature of a manifold. We show this curvature has the property that its negative values

Diameter bounds for planar graphs
Diameter bounds for planar graphs
✍ Radoslav Fulek; Filip MoriΔ‡; David Pritchard πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 313 KB
A GRASP for graph planarization
A GRASP for graph planarization
✍ Resende, Mauricio G. C.; Ribeiro, Celso C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 268 KB πŸ‘ 2 views

A greedy randomized adaptive search procedure (GRASP) is a metaheuristic for combinatorial optimization. In this paper, we describe a GRASP for the graph planarization problem, extending the heuristic of Goldschmidt and Takvorian [ Networks 24 (1994) 69-73]. We review the basic concepts of GRASP: co