Abstract: This paper proposes a compression framework for adjacency matrices of weighted graphs based on graph filter banks. Adjacency matrices are widely used mathematical representations of graphs ...

Takes an appropriately formatted txt file, translates an undirected, unweighted graph into an adjacency matrix, and outputs the number of connected components within the graph.

Abstract: Depending on the node ordering, an adjacency matrix can highlight distinct characteristics of a graph. Deriving a “proper” node ordering is thus a critical step in visualizing a graph as an ...

This project had me use an adjacency matrix to model a weighted digraph representing the stages of a project. Given input for a graph, this program calculates a ...

With the generation of a large amount of sequencing data, different assemblers have emerged to perform de novo genome assembly. As a single strategy is hard to fit various biases of datasets, none of ...