scientific article; zbMATH DE number 7236457
From MaRDI portal
Publication:5115821
bounded-degree maximum-weight induced subgraphscircle graphscircular layoutscrossing minimizationgraph drawing
Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)
Recommendations
- Minimizing crossings in constrained two-sided circular graph layouts
- Approximating Crossing Minimization in Radial Layouts
- scientific article; zbMATH DE number 1500682
- Crossing edge minimization in radial outerplanar layered graphs using segment paths
- Crossing minimization in extended level drawings of graphs
- Crossing minimization and layouts of directed hypergraphs with port constraints
- Approximation algorithms for minimizing edge crossings in radial drawings
- scientific article; zbMATH DE number 1487879
- Crossing minimization in linear embeddings of graphs
- Minimum Cuts for Circular-Arc Graphs
Cites work
- Algorithms and Computation
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- An annotated bibliography on 1-planarity
- Crossing minimization in linear embeddings of graphs
- Experimental evaluation of book drawing algorithms
- Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes
- Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
- Graph-Theoretic Concepts in Computer Science
- scientific article; zbMATH DE number 1354124 (Why is no real title available?)
- Improved Circular Layouts
- Large Induced Subgraphs via Triangulations and CMSO
- Node-and edge-deletion NP-complete problems
- On bounded-degree vertex deletion parameterized by treewidth
- On structural parameterizations of the bounded-degree vertex deletion problem
- The book crossing number of a graph
- The Bundled Crossing Number
- The complexity of domination problems in circle graphs
- TREEWIDTH OF CIRCLE GRAPHS
Cited in
(6)- On circular layouts∗
- Minimum-diameter cyclic arrangements in mapping data-flow graphs onto VLSI arrays
- Connecting the dots (with minimum crossings)
- Minimizing crossings in constrained two-sided circular graph layouts
- Graph-Theoretic Concepts in Computer Science
- Grid recognition: classical and parameterized computational perspectives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5115821)
