The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
May. 27, 2014

Filed:

Jan. 24, 2011
Applicants:

Daniel Delling, Mountain View, CA (US);

Andrew V. Goldberg, Redwood City, CA (US);

Ilya Razenshteyn, Nizhniy Novgorod, RU;

Renato F. Werneck, San Francisco, CA (US);

Inventors:

Daniel Delling, Mountain View, CA (US);

Andrew V. Goldberg, Redwood City, CA (US);

Ilya Razenshteyn, Nizhniy Novgorod, RU;

Renato F. Werneck, San Francisco, CA (US);

Assignee:

Microsoft Corporation, Redmond, WA (US);

Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06F 17/00 (2006.01); G06N 5/02 (2006.01);
U.S. Cl.
CPC ...
Abstract

Graph partitioning techniques are based on the notion of natural cuts. A filtering phase performs a series of minimum cut computations to identify and contract dense regions of the graph. This reduces the graph size significantly, but preserves its general structure. An assembly phase uses a combination of greedy and local search heuristics to assemble the final partition. The techniques may be used on road networks, which have an abundance of natural cuts (such as bridges, mountain passes, and ferries).


Find Patent Forward Citations

Loading…