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 conta...

Full description

Bibliographic Details
Main Author:	Dutson, Brent
Format:	Others
Published:	DigitalCommons@USU 2014
Subjects:	Hardness Quantification Graphs Computational Study Computer Sciences
Online Access:	https://digitalcommons.usu.edu/etd/3903 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=4908&context=etd

id	ndltd-UTAHS-oai-digitalcommons.usu.edu-etd-4908
record_format	oai_dc
spelling	ndltd-UTAHS-oai-digitalcommons.usu.edu-etd-49082019-10-13T06:01:53Z Information and Hardness Quantification of Graphs: A Computational Study Dutson, Brent 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. 2014-05-01T07:00:00Z text application/pdf https://digitalcommons.usu.edu/etd/3903 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=4908&context=etd Copyright 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). All Graduate Theses and Dissertations DigitalCommons@USU Hardness Quantification Graphs Computational Study Computer Sciences
collection	NDLTD
format	Others
sources	NDLTD
topic	Hardness Quantification Graphs Computational Study Computer Sciences
spellingShingle	Hardness Quantification Graphs Computational Study Computer Sciences Dutson, Brent Information and Hardness Quantification of Graphs: A Computational Study
description	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.
author	Dutson, Brent
author_facet	Dutson, Brent
author_sort	Dutson, Brent
title	Information and Hardness Quantification of Graphs: A Computational Study
title_short	Information and Hardness Quantification of Graphs: A Computational Study
title_full	Information and Hardness Quantification of Graphs: A Computational Study
title_fullStr	Information and Hardness Quantification of Graphs: A Computational Study
title_full_unstemmed	Information and Hardness Quantification of Graphs: A Computational Study
title_sort	information and hardness quantification of graphs: a computational study
publisher	DigitalCommons@USU
publishDate	2014
url	https://digitalcommons.usu.edu/etd/3903 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=4908&context=etd
work_keys_str_mv	AT dutsonbrent informationandhardnessquantificationofgraphsacomputationalstudy
_version_	1719267305121120256

Information and Hardness Quantification of Graphs: A Computational Study

Similar Items