Search
Search Results
-
CAGE: Cache-Aware Graphlet Enumeration
When information is (implicitly or explicitly) linked in its own nature, and is modeled as a network, retrieving patterns can benefit from this...
-
The Role of Graphlets in Viral Processes on Networks
Predicting the evolution of viral processes on networks is an important problem with applications arising in biology, the social sciences, and the...
-
The Novel Generally Described Graphs for Cyclic Orthogonal Double Covers of Some Circulants
AbstractCirculant graphs nowadays have a vast number of important applications due to the tremendous developments in modern technologies....
-
Graph Pseudometrics from a Topological Point of View
We explore pseudometrics for directed graphs in order to better understand their topological properties. The directed flag complex associated to a...
-
Motif Finding Algorithms: A Performance Comparison
Network motifs are subgraphs of a network that occur more frequently than expected, according to some reasonable null model. They represent building...
-
A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs
In this article, we describe algorithms and techniques used in the method ExTREEm for the treedepth decomposition problem. ExTREEm won the heuristic...
-
Heat diffusion distance processes: a statistically founded method to analyze graph data sets
We propose two multiscale comparisons of graphs using heat diffusion, allowing to compare graphs without node correspondence or even with different...
-
On Whole-Graph Embedding Techniques
Networks provide suitable representative models in many applications, ranging from social to life sciences. Such representations are able to capture...
-
Higher-Order Structure-Based Graph Decomposition
Higher-order structures, also known as motifs or graphlets, have been recently used to successfully locate dense regions that cannot be detected...
-
Efficiently counting complex multilayer temporal motifs in large-scale networks
This paper proposes novel algorithms for efficiently counting complex network motifs in dynamic networks that are changing over time. Network motifs...
-
Algorithms for Finding Motifs in Large Labeled Networks
The goal of this chapter is to introduce the different kinds of subgraph analysis problems and discuss some of the important parallel algorithmic...