Revisited Experimental Comparison of Node-Link and Matrix Representations

DOI10.1007/978-3-319-73915-1_23zbMath1503.68230arXiv1709.00293OpenAlexW2750937931MaRDI QIDQ4625118

Mershack Okoe, Stephen G. Kobourov, Radu Jianu

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.00293

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

On time and space: an experimental study on graph structural and temporal encodings ⋮ Turning cliques into paths to achieve planarity

Cites Work

• Smooth projective hashing and two-message oblivious transfer
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Public Key Cryptography - PKC 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: Revisited Experimental Comparison of Node-Link and Matrix Representations