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.
Patent No.:
Date of Patent:
Jul. 30, 2013
Filed:
Jun. 04, 2009
Yin Xie, Bellevue, WA (US);
Chris D. Karkanias, Sammamish, WA (US);
George G. Robertson, Northeast Harbor, ME (US);
Yin Xie, Bellevue, WA (US);
Chris D. Karkanias, Sammamish, WA (US);
George G. Robertson, Northeast Harbor, ME (US);
Microsoft Corporation, Redmond, WA (US);
Abstract
Described is a technology for reducing the layout complexity of a graph, e.g., an STT graph. Nodes with similar incoming and outgoing links are grouped as candidate groupings to possibly be clustered. For each candidate grouping, if the nodes in the candidate grouping and/or the candidate grouping meet clustering criteria, the candidate grouping is clustered into a clustered node. The criteria may include user-specified parameters directed towards the nodes and/or the candidate groupings. For example, a node is removed from a group if the number of incoming links thereto or the number of outgoing links therefrom exceed maximum incoming and outgoing parameter values, respectively. A group is only clustered if the number of nodes therein meets a minimum size parameter.