Sphere-of-influence graphs using the sup-norm
From MaRDI portal
Publication:5927945
DOI10.1016/S0895-7177(00)00191-6zbMath0978.05065OpenAlexW1963556459MaRDI QIDQ5927945
Elizabeth D. Boyer, L. Lister, Bryan L. Shader
Publication date: 25 March 2001
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0895-7177(00)00191-6
Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (5)
GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ On the \(SIG\)-dimension of trees under the \(L_\infty\)-metric ⋮ SIG-dimension conjecture proved for graphs having a perfect matching ⋮ Sphericity, cubicity, and edge clique covers of graphs ⋮ Cubicity, boxicity, and vertex cover
Cites Work
This page was built for publication: Sphere-of-influence graphs using the sup-norm