Return to search

Information and Hardness Quantification of Graphs: A Computational Study

New techniques to measure the information contained within a network of interconnected nodes (such as links between computers in the Internet) have recently been developed. This work studies the relationship between the computer time needed to solve a common network problem and the information contained within the given network.

Identiferoai:union.ndltd.org:UTAHS/oai:digitalcommons.usu.edu:etd-4908
Date01 May 2014
CreatorsDutson, Brent
PublisherDigitalCommons@USU
Source SetsUtah State University
Detected LanguageEnglish
Typetext
Formatapplication/pdf
SourceAll Graduate Theses and Dissertations
RightsCopyright for this work is held by the author. Transmission or reproduction of materials protected by copyright beyond that allowed by fair use requires the written permission of the copyright owners. Works not in the public domain cannot be commercially exploited without permission of the copyright owner. Responsibility for any use rests exclusively with the user. For more information contact Andrew Wesolek (andrew.wesolek@usu.edu).

Page generated in 0.0021 seconds