In the case of an undirected graph, the adjacency_matrix. class does not use a full V x V matrix but instead uses a lower triangle (the diagonal and below) since the matrix for an undirected graph is ...

An undirected graph is semi-transitive if it admits a semi-transitive orientation. Semi-transitive graphs generalize several important classes of graphs and they are precisely the class of ...

We also develop several new variants for exact triangle counting in large sparse, undirected graphs. We show that our parallel triangle counting variants outperform other recently-developed triangle ...

Rows zero through five of Pascal’s triangle. The pattern continues on into infinity. Two of the sides are filled with 1's and all the other numbers are generated by adding the two numbers above.