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...
Main Author: | Dutson, Brent |
---|---|
Format: | Others |
Published: |
DigitalCommons@USU
2014
|
Subjects: | |
Online Access: | https://digitalcommons.usu.edu/etd/3903 https://digitalcommons.usu.edu/cgi/viewcontent.cgi?article=4908&context=etd |
Similar Items
-
Exact transcript quantification over splice graphs
by: Cong Ma, et al.
Published: (2021-05-01) -
Exact transcript quantification over splice graphs
by: Kingsford, C., et al.
Published: (2021) -
An Extended Hybrid Image Compression Based on Soft-to-Hard Quantification
by: Haisheng Fu, et al.
Published: (2020-01-01) -
On Computational Hardness of Multidimensional Subtraction Games
by: Vladimir Gurvich, et al.
Published: (2021-02-01) -
Semi-automated quantification of hard exudates in colour fundus photographs diagnosed with diabetic retinopathy
by: Abhilash Goud Marupally, et al.
Published: (2017-09-01)