Optimizing edge crossing computations when creating a drawing of a directed graph having a minimum number of edge crossings
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
Mar 31, 2015
Grant Date -
Mar 25, 2010
app pub date -
Sep 25, 2008
filing date -
Sep 25, 2008
priority date (Note) -
In Force
status (Latency Note)
Importance
Abstract
A candidate graph crossing point counter can be initialized. Level pairs can be sorted in descending order according to a number of connections between the level pairs. Evaluation of the candidate graph can progress according to the order of the level pairs so that those pairs likely to have the greatest number of connections are processed first. While the candidate graph crossing point counter is at an intermediate value and before a crossing point total is calculated for the candidate graph, it can be determined that the intermediate value is at least as great as a crossing point total of a best current graph for the directional graph. Calculation of the candidate graph crossing point total can be halted at the intermediate value. The candidate graph can be discarded from a possibility of being a minimized graph during a determination of a graph drawing for the directional graph.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Advertisement
Advertisement
Advertisement
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully