Quantum graph drawing
From MaRDI portal
Cites work
- 2-Layer k-Planar Graphs
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
- A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
- A faster fixed parameter algorithm for two-layer crossing minimization
- A linear edge kernel for two-layer crossing minimization
- Book embeddings and crossing numbers
- Counting edge crossings in a 2-layered drawing
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
- Crossing Number is NP-Complete
- Edge crossings in drawings of bipartite graphs
- Edge-Deletion Problems
- Encyclopedia of algorithms. In 3 volumes
- Exact algorithms for the quadratic linear ordering problem
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- On the parameterized complexity of layered graph drawing
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Quantum algorithms for one-sided crossing minimization
- Quantum computing. A gentle introduction
- Quantum graph drawing (best student paper)
- Quantum Optics and Quantum Computation
- The book thickness of a graph
- The consecutive ones submatrix problem for sparse matrices
- The edge-coloring of complete hypergraphs. I
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
This page was built for publication: Quantum graph drawing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7357199)
