Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- short-paperOctober 2021
Embedding Node Structural Role Identity Using Stress Majorization
CIKM '21: Proceedings of the 30th ACM International Conference on Information & Knowledge ManagementPages 3473–3477https://doi.org/10.1145/3459637.3482095Nodes in networks may have one or more functions that determine their role in the system. As opposed to local proximity, which captures the local context of nodes, the role identity captures the functional "role" that nodes play in a network, such as ...
- ArticleSeptember 2014
Stress-Minimizing Orthogonal Layout of Data Flow Diagrams with Ports
GD 2014: Revised Selected Papers of the 22nd International Symposium on Graph Drawing - Volume 8871Pages 319–330https://doi.org/10.1007/978-3-662-45803-7_27We present a fundamentally different approach to orthogonal layout of data flow diagrams with ports. This is based on extending constrained stress majorization to cater for ports and flow layout. Because we are minimizing stress we are able to better ...
- research-articleNovember 2008
Exploration of Networks using overview+detail with Constraint-based cooperative layout
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 14, Issue 6Pages 1293–1300https://doi.org/10.1109/TVCG.2008.130A standard approach to large network visualization is to provide an overview of the network and a detailed view of a small component of the graph centred around a focal node.The user explores the network by changing the focal node in the detailed view ...
- research-articleSeptember 2006
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs
IEEE Transactions on Visualization and Computer Graphics (ITVC), Volume 12, Issue 5Pages 821–828https://doi.org/10.1109/TVCG.2006.156We extend the popular force-directed approach to network (or graph) layout to allow separation constraints, which enforce a minimum horizontal or vertical separation between selected pairs of nodes. This simple class of linear constraints is expressive ...