scientific article
From MaRDI portal
Publication:3920971
zbMath0467.90028MaRDI QIDQ3920971
Robert Menard, Godfried T. Toussaint
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmspolynomial algorithmsupergraphplanar graphcomputational geometryminimal spanning treegeometric complexityrelative neighborhood graph
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Extremal problems in graph theory (05C35) Inventory, storage, reservoirs (90B05) General theory of distance geometry (51K05) Real and complex geometry (51M99)
Related Items (4)
Computing relative neighbourhood graphs in the plane ⋮ The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric ⋮ An almost naive algorithm for finding relative neighbourhood graphs in $L_p$ metrics ⋮ Graph theoretical clustering based on limited neighbourhood sets
This page was built for publication:
