With the rapid development of information technologies, various big graphs are prevalent in
many real applications (eg, social media and knowledge bases). An important component of …

The Densest Subgraph Problem requires us to find, in a given graph, a subset of vertices
whose induced subgraph maximizes a measure of density. The problem has received a …

Zero-knowledge proof is a powerful cryptographic primitive that has found various
applications in the real world. However, existing schemes with succinct proof size suffer from …

Background Recent advances in proteomics technologies such as two-hybrid, phage
display and mass spectrometry have enabled us to create a detailed map of biomolecular …

It has widely been recognized that submodular functions play essential roles in efficiently
solvable combinatorial optimization problems. Since the publication of the 1st edition of this …

'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …

Finding dense subgraphs is an important graph-mining task with many applications. Given
that the direct optimization of edge density is not meaningful, as even a single edge …

The classical maximum flow problem sometimes occurs in settings in which the arc
capacities are not fixed but are functions of a single parameter, and the goal is to find the …

Numerous graph mining applications rely on detecting subgraphs which are large near-
cliques. Since formulations that are geared towards finding large near-cliques are hard and …

There has been significant recent interest in parallel graph processing due to the need to
quickly analyze the large graphs available today. Many graph codes have been designed …