<--- Back to Details
First PageDocument Content
Network flow / Combinatorial optimization / Graph connectivity / Operations research / Maximum flow problem / Push-relabel maximum flow algorithm / Cut / Randomized algorithm / Flow network / Graph theory / Mathematics / Theoretical computer science
Date: 2006-10-14 07:27:59
Network flow
Combinatorial optimization
Graph connectivity
Operations research
Maximum flow problem
Push-relabel maximum flow algorithm
Cut
Randomized algorithm
Flow network
Graph theory
Mathematics
Theoretical computer science

Add to Reading List

Source URL: dspace.mit.edu

Download Document from Source Website

File Size: 1,99 MB

Share Document on Facebook

Similar Documents

Cryptographic protocols / Logic gates / Theoretical computer science / Electromagnetism / Circuit complexity / Electronics / Garbled circuit / Secure multi-party computation / Digital electronics / Secure two-party computation / XOR gate / Electronic circuit

DUPLO: Unifying Cut-and-Choose for Garbled Circuits

DocID: 1xVJh - View Document

Cut Fold First simple steps

DocID: 1xVvw - View Document

Starting from 16 January 2015, HSBC will extend the cut-off time of BAHTNET transaction as per below. Payment Services BAHTNET

DocID: 1xVlO - View Document

Price indices / Heat-not-burn tobacco product / Bloomberg L.P. / Communist Party of India / Consumer price index / Economy of New York City / Finance / Economy

Tobacco industry faces technological disruption Effect on equity and credit for Philip Morris Earnings forecast cut IQOS sales

DocID: 1xUsE - View Document

Cryptographic protocols / Electromagnetism / Garbled circuit / Secure multi-party computation / IP / Theory of computation / NC / Electronic circuit / Applied mathematics / Commitment scheme

CS 294 – Secure Computation February 16 and 18, 2016 Lecture 9 and 10: Malicious Security - GMW Compiler and Cut and Choose, OT Extension

DocID: 1xTR2 - View Document