Back to search

Hosted by Utah State University Libraries

Information and Hardness Quantification of Graphs: A Computational Study

Abstract

dc:description.abstract

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.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Dutson, Brent
Contributors dc:contributor
  • Nicholas Flann
  • Daniel Watson
  • Curtis Dyreson

Subjects

dc:subject × 4

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Dutson, Brent. Information and Hardness Quantification of Graphs: A Computational Study. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/3903