Single source - all sinks max flows in planar digraphs

Jakub Lacki; Yahav Nussbaum; Piotr Sankowski; Christian Wulff-Nilsen

doi:10.1109/FOCS.2012.66

Single source - all sinks max flows in planar digraphs

Jakub Lacki, Yahav Nussbaum, Piotr Sankowski, Christian Wulff-Nilsen

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

31 Citations (Scopus)

Original language	English
Title of host publication	2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS)
Number of pages	10
Publisher	IEEE
Publication date	2012
Pages	599-608
ISBN (Print)	978-0-7685-4874-6
DOIs	https://doi.org/10.1109/FOCS.2012.66
Publication status	Published - 2012
Event	IEEE 53rd Annual Symposium on Foundations of Computer Science - New Brunswick, New Jersey, United States Duration: 20 Oct 2012 → 23 Oct 2012 Conference number: 53

Conference

Conference	IEEE 53rd Annual Symposium on Foundations of Computer Science
Number	53
Country/Territory	United States
City	New Brunswick, New Jersey
Period	20/10/2012 → 23/10/2012

Access to Document

10.1109/FOCS.2012.66

Cite this

@inproceedings{59e4b3b2d6454727847e3a4a2f29bf78,

title = "Single source - all sinks max flows in planar digraphs",

keywords = "computational complexity, directed graphs, Borradaile-Klein algorithm, all-pairs max how values problem, data structure, max st-flow values, min cut-sets, near-linear time, near-quadratic time, planar n-vertex digraph, single-source single sink max how algorithm, Computer science, Data structures, Educational institutions, Electronic mail, Informatics, Partitioning algorithms, Standards, all pairs, maximum flow, minimum cut, planar graph",

author = "Jakub Lacki and Yahav Nussbaum and Piotr Sankowski and Christian Wulff-Nilsen",

year = "2012",

doi = "10.1109/FOCS.2012.66",

language = "English",

isbn = "978-0-7685-4874-6",

pages = "599--608",

booktitle = "2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS)",

publisher = "IEEE",

note = "null ; Conference date: 20-10-2012 Through 23-10-2012",

}

TY - GEN

T1 - Single source - all sinks max flows in planar digraphs

AU - Lacki, Jakub

AU - Nussbaum, Yahav

AU - Sankowski, Piotr

AU - Wulff-Nilsen, Christian

N1 - Conference code: 53

PY - 2012

Y1 - 2012

KW - computational complexity

KW - directed graphs

KW - Borradaile-Klein algorithm

KW - all-pairs max how values problem

KW - data structure

KW - max st-flow values

KW - min cut-sets

KW - near-linear time

KW - near-quadratic time

KW - planar n-vertex digraph

KW - single-source single sink max how algorithm

KW - Computer science

KW - Data structures

KW - Educational institutions

KW - Electronic mail

KW - Informatics

KW - Partitioning algorithms

KW - Standards

KW - all pairs

KW - maximum flow

KW - minimum cut

KW - planar graph

U2 - 10.1109/FOCS.2012.66

DO - 10.1109/FOCS.2012.66

M3 - Article in proceedings

SN - 978-0-7685-4874-6

SP - 599

EP - 608

BT - 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS)

PB - IEEE

Y2 - 20 October 2012 through 23 October 2012

ER -