Graph Drawing and Applications for Software and Knowledge Engineers
From MaRDI portal
Publication:4544341
Recommendations
Cited in
(33)- An annotated review on graph drawing and its applications
- 2-Layer k-Planar Graphs
- HV-planarity: algorithms and complexity
- Handbook of graph drawing and visualization
- scientific article; zbMATH DE number 5052319 (Why is no real title available?)
- scientific article; zbMATH DE number 1693475 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Drawing colored graphs on colored points
- scientific article; zbMATH DE number 4121464 (Why is no real title available?)
- Matched drawability of graph pairs and of graph triples
- Drawing colored graphs with constrained vertex positions and few bends per edge
- scientific article; zbMATH DE number 2084305 (Why is no real title available?)
- scientific article; zbMATH DE number 2016093 (Why is no real title available?)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- Matched Drawability of Graph Pairs and of Graph Triples
- An open graph visualization system and its applications to software engineering
- Triangulations with Circular Arcs
- Approximation algorithms for minimizing edge crossings in radial drawings
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph
- 2-layer right angle crossing drawings
- scientific article; zbMATH DE number 2080096 (Why is no real title available?)
- Graph drawing software
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- The topological drawing of a graph: construction methods
- scientific article; zbMATH DE number 2079638 (Why is no real title available?)
- Constrained Point-Set Embeddability of Planar Graphs
- ChordLink: a new hybrid visualization model
- An annotated bibliography on 1-planarity
- 10 reasons to get interested in graph drawing
- scientific article; zbMATH DE number 2084302 (Why is no real title available?)
- Graph Algorithms and Applications 3
- 1-bend upward planar slope number of SP-digraphs
- Counting edge crossings in a 2-layered drawing
This page was built for publication: Graph Drawing and Applications for Software and Knowledge Engineers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544341)