Visualizing treewidth
From MaRDI portal
Cites work
- A topology-shape-metrics framework for ortho-radial graph drawing
- An Experimental Study of the Treewidth of Real-World Graph Data
- An improved algorithm for the metro-line crossing minimization problem
- Block crossings in storyline visualizations
- Boundary labeling in a circular orbit
- Certifying algorithms
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Checking geometric programs or verification of geometric structures
- Computing storyline visualizations with few block crossings
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing Minimization in Storyline Visualization
- Diameter and treewidth in minor-closed graph families
- Edge routing with ordered bundles
- Edge routing with ordered bundles
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Experimental evaluation of book drawing algorithms
- Graph-Theoretic Concepts in Computer Science
- Graphtrials: visual proofs of graph properties
- scientific article; zbMATH DE number 2084318 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 2038697 (Why is no real title available?)
- scientific article; zbMATH DE number 2079335 (Why is no real title available?)
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- Improved Circular Layouts
- Layout of Graphs with Bounded Tree-Width
- Line Crossing Minimization on Metro Maps
- Metro-line crossing minimization: hardness, approximations, and tractable cases
- Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
- Mutual witness Gabriel drawings of complete bipartite graphs
- Mutual witness Gabriel drawings of complete bipartite graphs
- On metro-line crossing minimization
- On minimizing crossings in storyline visualizations
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- On-line maintenance of triconnected components with SPQR-trees
- Parameterized algorithms
- Revisiting ILP models for exact crossing minimization in storyline drawings
- Structure of graphs with locally restricted crossings
- The book thickness of a graph
- Tree-width, path-width, and cutwidth
- Treewidth: Characterizations, Applications, and Computations
- What is \dots{} treewidth?
- Witness (Delaunay) graphs
- Witness Gabriel graphs
- Witness rectangle graphs
- Witness rectangle graphs
This page was built for publication: Visualizing treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7354807)
