Pages that link to "Item:Q4544341"
From MaRDI portal
The following pages link to Graph Drawing and Applications for Software and Knowledge Engineers (Q4544341):
Displaying 19 items.
- Recognizing and drawing IC-planar graphs (Q290513) (← links)
- The topological drawing of a graph: construction methods (Q386927) (← links)
- 2-layer right angle crossing drawings (Q476445) (← links)
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis (Q903597) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Matched drawability of graph pairs and of graph triples (Q982951) (← links)
- HV-planarity: algorithms and complexity (Q1628786) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- 1-bend upward planar slope number of SP-digraphs (Q2206732) (← links)
- ChordLink: a new hybrid visualization model (Q2206859) (← links)
- Counting edge crossings in a 2-layered drawing (Q2390316) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Matched Drawability of Graph Pairs and of Graph Triples (Q3605508) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- 2-Layer k-Planar Graphs (Q5014133) (← links)
- Triangulations with Circular Arcs (Q5895516) (← links)
- Approximation algorithms for minimizing edge crossings in radial drawings (Q5961979) (← links)
