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

Geodesics in graphs, an extremal set problem, and perfect hash families

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

DOI10.1007/s003730200030zbMath1009.05129OpenAlexW1986997751MaRDI QIDQ1865133

Andrew Vince, Mustafa Atici

Publication date: 25 March 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s003730200030


zbMATH Keywords

geodesicshash functionsseparating set problem


Mathematics Subject Classification ID

Cryptography (94A60) Extremal set theory (05D05)


Related Items (2)

On pitfalls in computing the geodetic number of a graph ⋮ On The Edge Geodetic Number Of A Graph






This page was built for publication: Geodesics in graphs, an extremal set problem, and perfect hash families

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