Distance preserving graphs / by Emad Zahedi.

"The computational complexity of exploring distance properties of large graphs such as real-world social networks which consist of millions of nodes is extremely expensive. Recomputing distances in subgraphs of the original graph will add to the cost. One way to avoid this is to use subgraphs where...

Full description

Bibliographic Details
Main Author: Zahedi, Emad (Author)
Language:English
Published: 2017.
Subjects:
Graphic methods.
Isometrics (Mathematics)
Graph theory.
Electronic dissertations.
Academic theses.
Genre:
Electronic dissertations.
Academic theses.
Online Access:
Connect to online resource - All users (Digital Object Identifier Permalink)
Connect to online resource - MSU authorized users
Dissertation Note:
Ph. D. Michigan State University. Mathematics 2017
Physical Description:1 online resource (ix, 67 pages) : illustrations (some color)
Format: Thesis Electronic eBook

System Under Maintenance

Our Library Management System is currently under maintenance.

Holdings and item availability information is currently unavailable. Please accept our apologies for any inconvenience this may cause and contact us for further assistance:

Please contact Reference and Discovery Services via their Contact Form or call them directly at: 517-353-8700 for assistance.

Online Access

Connect to online resource - All users (Digital Object Identifier Permalink)
Connect to online resource - MSU authorized users