Simple algorithms for network visualization: A tutorial

MJ McGuffin - Tsinghua Science and Technology, 2012 - ieeexplore.ieee.org
The graph drawing and information visualization communities have developed many
sophisticated techniques for visualizing network data, often involving complicated algorithms …

Energy models for graph clustering

A Noack - Journal of graph algorithms and applications, 2007 - jgaa.info
The cluster structure of many real-world graphs is of great interest, as the clusters may
correspond eg to communities in social networks or to cohesive modules in software …

[图书][B] Quantum computer systems: Research for noisy intermediate-scale quantum computers

Y Ding, FT Chong - 2020 - books.google.com
This book targets computer scientists and engineers who are familiar with concepts in
classical computer systems but are curious to learn the general architecture of quantum …

[PDF][PDF] Scalable visualization of semantic nets using power-law graphs

A Hussain, K Latif, AT Rextin… - Applied Mathematics …, 2014 - naturalspublishing.com
Scalability and performance implications of semantic net visualization techniques are open
research challenges. This paper focuses on developing a visualization technique that …

Haptic and visual comprehension of a 2D graph layout through physicalisation

A Drogemuller, A Cunningham, JA Walsh… - Proceedings of the …, 2021 - dl.acm.org
Data physicalisations afford people the ability to directly interact with data using their hands,
potentially achieving a more comprehensive understanding of a dataset. Due to their …

Magic-state functional units: Mapping and scheduling multi-level distillation circuits for fault-tolerant quantum architectures

Y Ding, A Holmes, A Javadi-Abhari… - 2018 51st Annual …, 2018 - ieeexplore.ieee.org
Quantum computers have recently made great strides and are on a long-term path towards
useful fault-tolerant computation. A dominant overhead in fault-tolerant quantum …

Change management in evolving web ontologies

AM Khattak, K Latif, S Lee - Knowledge-Based Systems, 2013 - Elsevier
Knowledge constantly grows in scientific discourse and is revised over time by different
stakeholders, either collaboratively or through institutionalized efforts. The body of …

Multi-level area balancing of clustered graphs

HY Wu, M Nöllenburg, I Viola - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
We present a multi-level area balancing technique for laying out clustered graphs to
facilitate a comprehensive understanding of the complex relationships that exist in various …

Nonlinear topological component analysis: application to age-invariant face recognition

D Bouchaffra - IEEE transactions on neural networks and …, 2014 - ieeexplore.ieee.org
We introduce a novel formalism that performs dimensionality reduction and captures
topological features (such as the shape of the observed data) to conduct pattern …

The straight-line RAC drawing problem is NP-hard

E Argyriou, M Bekos, A Symvonis - Journal of Graph Algorithms and …, 2012 - jgaa.info
A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges
intersects at right angle. In this paper, we focus on straight-line RAC drawings and …