{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-4908"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-4908","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Information and Hardness Quantification of Graphs: A Computational Study","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.","abstract_html":"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.","abstract_has_math":false,"creators":["Dutson, Brent"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Nicholas Flann","Daniel Watson","Curtis Dyreson"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:48:19Z","subjects":["Hardness Quantification","Graphs","Computational Study","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/3beb-3fe5"],"render_values":[{"text":"https://doi.org/10.26076/3beb-3fe5","href":"https://doi.org/10.26076/3beb-3fe5","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/3903","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/3903","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-4908","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Nicholas Flann","Daniel Watson","Curtis Dyreson"]},{"key":"dc:creator","label":"Author","values":["Dutson, Brent"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2010-01-01T08:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2014-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Hardness Quantification","Graphs","Computational Study","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/3903"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/3beb-3fe5"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Information and Hardness Quantification of Graphs: A Computational Study"]}]}],"canonical_facts":{"dc:contributor":["Nicholas Flann","Daniel Watson","Curtis Dyreson"],"dc:creator":["Dutson, Brent"],"dc:date.available":["2010-01-01T08:00:00Z"],"dc:date.created":["2014-05-01T07:00:00Z"],"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."],"dc:identifier":["https://digitalcommons.usu.edu/etd/3903"],"dc:identifier.doi":["https://doi.org/10.26076/3beb-3fe5"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Hardness Quantification","Graphs","Computational Study","Computer Sciences"],"dc:title":["Information and Hardness Quantification of Graphs: A Computational Study"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:48:19Z"}