Parallel minimum cuts in near-linear work and low depth
B Geissmann, L Gianinazzi - Proceedings of the 30th on Symposium on …, 2018 - dl.acm.org
We present the first near-linear work and poly-logritharithmic depth algorithm for computing
a minimum cut in a graph, while previous parallel algorithms with poly-logarithmic depth …
a minimum cut in a graph, while previous parallel algorithms with poly-logarithmic depth …
Massively parallel computation on embedded planar graphs
Many of the classic graph problems cannot be solved in the Massively Parallel Computation
setting (MPC) with strongly sublinear space per machine and o (log n) rounds, unless the 1 …
setting (MPC) with strongly sublinear space per machine and o (log n) rounds, unless the 1 …
Testing vertex connectivity of bowtie 1-plane graphs
K Murali - 2022 - uwspace.uwaterloo.ca
A separating set of a connected graph $ G $ is a set of vertices $ S $ such that $ GS $ is
disconnected. $ S $ is a minimum separating set of $ G $ if there is no separating set of $ G …
disconnected. $ S $ is a minimum separating set of $ G $ if there is no separating set of $ G …
Set-Centric Subgraph Isomorphism
L Kapp-Schwoerer - 2021 - research-collection.ethz.ch
We investigate techniques for accelerating subgraph isomorphism (SI). SI is the task of
finding occurrences of a pattern graph in a target graph and relevant to many practical …
finding occurrences of a pattern graph in a target graph and relevant to many practical …