Back to Results
First PageMeta Content
Spanning tree / NP-complete problems / Network flow / Routing algorithms / Graph / Tree decomposition / Bridge / Tree / Flow network / Graph theory / Mathematics / Theoretical computer science


Math. Program., Ser. A manuscript No. (will be inserted by the editor) An Exact Combinatorial Algorithm for Minimum Graph Bisection Daniel Delling · Daniel Fleischman ·
Add to Reading List

Document Date: 2014-12-16 13:53:35

Open Document

File Size: 1,47 MB

Share Result on Facebook

City

Extended Flow / /

Company

Microsoft / Artificial Intelligence Laboratory / /

/

Facility

Although building / Massachusetts Institute of Technology E-mail / /

IndustryTerm

polynomial-time solutions / machinery / breadth-first search / combinatorial exact algorithm / simultaneous depth-first search / computing / possible solutions / combinatorial algorithms / divide-and-conquer algorithms / local search runs / image processing / greedy algorithm / road networks / local search / /

Organization

D. Fleischman School of Operations Research and Information Engineering / Institute of Technology E-mail / Massachusetts Institute of Technology / Cornell University / /

Person

Renato F. Werneck / Andrew V. Goldberg / Daniel Fleischman / Daniel Delling / Ilya Razenshteyn / /

Position

editor / /

ProvinceOrState

Massachusetts / /

Technology

greedy algorithm / load balancing / SDFS algorithm / image processing / divide-and-conquer algorithms / /

SocialTag