Quantum graph drawing (best student paper)

DOI10.1007/978-981-97-0566-5_4MaRDI QIDQ6575378zbMATH OpenFDO

Authors Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista

Publication date 19 July 2024

zbMATH Keywords

quantum complexityGrover's algorithmD-waveQUBO2-level drawingsbook layouts

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 7788503 (Why is no real title available?)
• 1-page and 2-page drawings with bounded number of crossings per edge
• 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
• 2-layer right angle crossing drawings
• 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
• Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
• Book embeddings and crossing numbers
• Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
• Crossing Number is NP-Complete
• Crossing minimization for 1-page and 2-page drawings of graphs with bounded treewidth
• Drawing graphs in two layers
• Edge-Deletion Problems
• Embedding planar graphs in four pages
• Exact algorithms for the quadratic linear ordering problem
• On the parameterized complexity of layered graph drawing
• Quantum computing. A gentle introduction
• Simple and Efficient Bilayer Cross Counting
• The book thickness of a graph
• The consecutive ones submatrix problem for sparse matrices
• Two-layer drawings of bipartite graphs
• Two-page book embeddings of 4-planar graphs

This page was built for publication: Quantum graph drawing (best student paper)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575378)