Algorithms and Bounds for L-Drawings of Directed Graphs

Author:

Angelini Patrizio1,Lozzo Giordano Da2,Bartolomeo Marco Di3,Donato Valentino Di3,Patrignani Maurizio3,Roselli Vincenzo3,Tollis Ioannis G.4

Affiliation:

1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, Sand 14, 72076, Tübingen, Germany

2. Computer Science Department, University of California, Irvine, Donald Bren School of Information and Computer Sciences, Irvine, 92697-3435, CA, USA

3. Department of Engineering, Roma Tre University, Via Della Vasca Navale 79, 00146, Rome, Italy

4. Department of Computer Science, University of Crete, Heraklion, Greece

Abstract

We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of adjacency matrix representations. In an L-drawing, vertices have exclusive [Formula: see text]- and [Formula: see text]-coordinates and edges consist of two segments, one exiting the source vertically and one entering the destination horizontally. We study the problem of computing L-drawings using minimum ink. We prove its NP-hardness and provide a heuristic based on a polynomial-time algorithm that adds a vertex to a drawing using the minimum additional ink. We performed an experimental analysis of the heuristic which confirms its effectiveness.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Planar Confluent Orthogonal Drawings of 4-Modal Digraphs;Lecture Notes in Computer Science;2023

2. Parameterized and Approximation Algorithms for the Maximum Bimodal Subgraph Problem;Lecture Notes in Computer Science;2023

3. Stable visualization of connected components in dynamic graphs;Information Visualization;2020-11-24

4. Planar L-Drawings of Bimodal Graphs;Lecture Notes in Computer Science;2020

5. Computing k-Modal Embeddings of Planar Digraphs;LEIBNIZ INT PR INFOR;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3