Graph Drawing and Applications for Software and Knowledge Engineers
From MaRDI portal
Publication:4544341
DOI10.1142/4902zbMATH Open1011.68068OpenAlexW54026119MaRDI QIDQ4544341FDOQ4544341
Authors: Kozo Sugiyama 
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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01)
Cited In (33)
- ChordLink: a new hybrid visualization model
- An annotated review on graph drawing and its applications
- HV-planarity: algorithms and complexity
- Matched drawability of graph pairs and of graph triples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Recognizing and drawing IC-planar graphs
- Title not available (Why is that?)
- 2-layer right angle crossing drawings
- Approximation algorithms for minimizing edge crossings in radial drawings
- 2-Layer k-Planar Graphs
- Graph Algorithms and Applications 3
- 1-bend upward planar slope number of SP-digraphs
- Title not available (Why is that?)
- An open graph visualization system and its applications to software engineering
- Counting edge crossings in a 2-layered drawing
- Title not available (Why is that?)
- Handbook of graph drawing and visualization
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- Constrained Point-Set Embeddability of Planar Graphs
- An annotated bibliography on 1-planarity
- Triangulations with Circular Arcs
- Title not available (Why is that?)
- Drawing colored graphs on colored points
- Drawing colored graphs with constrained vertex positions and few bends per edge
- Matched Drawability of Graph Pairs and of Graph Triples
- Title not available (Why is that?)
- Graph drawing software
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph
- The topological drawing of a graph: construction methods
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)
