6 citations · 22 across the 11 of their papers we have counts for
Showing 2018 · cs.DSShow all
3 papers · 2 filters
cs.DS2018
A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks
Assaf Kfoury
We present an alternative and simpler method for computing principal typings of flow networks. When limited to planar flow networks, the method can be made to run in fixed-paramete…
cs.DS2018★ 1 cited
A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks
Assaf Kfoury
We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas.
cs.DS2018
Efficient Reassembling of Three-Regular Planar Graphs
Assaf Kfoury, Benjamin Sisson
A reassembling of a simple graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. There are several equivalent definitions of graph reassemb…