For real-world applications of machine learning (ML), it is essential th...
In a strongly connected graph G = (V,E), a cut arc (also called strong
b...
Minimum flow decomposition (MFD) is the NP-hard problem of finding a sma...
Decomposing a network flow into weighted paths has numerous applications...
Network flows are one of the most studied combinatorial optimization pro...
Genome assembly is a fundamental problem in Bioinformatics, where for a ...
Genome assembly is a fundamental problem in Bioinformatics, requiring to...
Given a directed graph G and a pair of nodes s and t, an s-t
bridge of G...
Given a directed graph G and a pair of nodes s and t, an s-t bridge
of G...
In recent years, significant advances have been made in the design and
a...
Depth first search (DFS) tree is a fundamental data structure for solvin...
We study three fundamental graph problems in the dynamic setting, namely...