Graph Drawing and Applications for Software and Knowledge Engineers
From MaRDI portal
Publication:4544341
DOI10.1142/4902zbMath1011.68068OpenAlexW54026119MaRDI QIDQ4544341
Publication date: 12 August 2002
Published in: Series on Software Engineering and Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/4902
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Recognizing and drawing IC-planar graphs ⋮ HV-planarity: algorithms and complexity ⋮ Counting edge crossings in a 2-layered drawing ⋮ An annotated bibliography on 1-planarity ⋮ The topological drawing of a graph: construction methods ⋮ An annotated review on graph drawing and its applications ⋮ A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners ⋮ Fast layout computation of clustered networks: algorithmic advances and experimental analysis ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ ChordLink: a new hybrid visualization model ⋮ 2-layer right angle crossing drawings ⋮ Drawing colored graphs on colored points ⋮ Maximum weighted matching with few edge crossings for 2-layered bipartite graph ⋮ Drawing colored graphs with constrained vertex positions and few bends per edge ⋮ Matched drawability of graph pairs and of graph triples ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Constrained Point-Set Embeddability of Planar Graphs ⋮ Approximation algorithms for minimizing edge crossings in radial drawings ⋮ Triangulations with Circular Arcs ⋮ 2-Layer k-Planar Graphs
