Recent advances in dynamic graph processing have enabled the analysis of highly dynamic graphs with change at rates as high as millions of edge changes per second. Solutions in this domain, however, ...

To solve the low attack path quantification degree and complex path finding in the industrial Internet of Things, a vulnerability assessment method based on attack graph and maximum flow is proposed.

Abstract: In this talk, I will present a new combinatorial algorithm for maximum flow that is based on running the weighted push-relabel algorithm introduced in [BBST'24] on "shortcut" graphs.

Maximum-Network-Flow A fictional project showcasing graph-based diagnostics for power grids. Analyzes maximum capacity, unmet demand, energy loss, and critical connections. Implemented in C/C++ with ...

Let G be a directed graph such that every edge e of G is associated with a positive integer, called the index of e. Then G is called a network graph if, at every vertex v of G, the sum of the indices ...