Abstract: Subgraph counting is a fundamental primitive in graph processing, with applications in social network analysis (e.g., estimating the clustering coefficient of a graph), database processing ...

Plotting a graph takes time. Often mathematicians just want to know the key features. These are: shape, location and some key points (such as where the graph crosses the axes or turning points). Aim ...

Abstract: In recent years, a variety of randomized constructions of sketching matrices have been devised, that have been used in fast algorithms for numerical linear algebra problems, such as least ...

Plotting a graph takes time. Often mathematicians just want to know the key features. These are: shape, location and some key points (such as where the graph crosses the axes or turning points).

High-throughput single-cell immune profiling technologies, such as mass cytometry (CyTOF) and single-cell RNA sequencing measure the expression of multiple proteins or genes across many individual ...

Graph Loops Finder is a command-line tool that takes a CSV file containing graph edges as input and identifies all loops in the graph. Loops are cycles of nodes where a path returns to the starting ...

This is a preview. Log in through your library . Abstract A class of global Lyapunov functions is revisited and used to resolve a long-standing open problem on the uniqueness and global stability of ...