Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:4028106
Jump to:navigation, search

zbMath0768.68116MaRDI QIDQ4028106

Johann Hagauer, Franz Aurenhammer

Publication date: 28 March 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

shortest pathHamming distancebinary Hamming graphbinary addressing scheme


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (4)

Faster isometric embedding in products of complete graphs ⋮ A multifacility location problem on median spaces ⋮ Skeletons, recognition algorithm and distance matrix of quasi-median graphs ⋮ Computing equivalence classes among the edges of a graph with applications




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4028106&oldid=17741102"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 6 February 2024, at 03:31.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki