Faster graph algorithms via switching classes
The runtime of an algorithm is intimately related to how an instance is represented. Recall that the runtimes of the first generation of graph algorithms were expressed as functions of n := |V|. This analysis was natural since at this time graphs were represented in n2 space via their adjacency matrix. It was soon noticed that if m := |E| = o(n2), then a variety of graph algorithms could be sped-up by computing the adjacency-list from the adjacency matrix, then running the algorithm on the more efficient adjacency-list representation. This motivated the introduction of m to the runtime of graph ...
(For more, see "View full record.")
born digital; masters theses
Showing items related by title, author, creator and subject.
Date:undatedNo. 244: Graph. Fall moisture and yield. No. 245: Graph. Use of water pounds per acre, acre feet.
Prioritizing candidate genes in disjoint sets using graph kernels on underlying protein-protein networks Author(s):Anderson, Kelsey CraigDate Submitted:2018Genome-wide association studies (GWAS) have become the main approach for studying the genetic architecture of common diseases and traits. GWAS correlate variants at genomic loci with the trait under study. Recovery of the ...
Author(s):Arthur Lakes Library; Russell L. and Lyn Wood Mining History Archive; United States. Bureau of MinesDate:1900?-1999?A three-dimensional bar graph shows the relationship between dust concentration, years of employment, and workers with pneumoconiosis.