A Heuristic for the Constrained One-Sided Two-Layered Crossing Reduction Problem for Dynamic Graph Layout
Data in real-world graph drawing applications often change frequently but incrementally. Any drastic change in the graph layout could disrupt a user's "mental map." Furthermore, real-world applications like enterprise process or e-commerce graphing, where data change rapidly in both c...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
NSUWorks
2011
|
| Subjects: | |
| Online Access: | http://nsuworks.nova.edu/gscis_etd/225 http://nsuworks.nova.edu/cgi/viewcontent.cgi?article=1224&context=gscis_etd |