A branch-and-cut approach to the crossing number problem-Reference-Cited by-同舟云学术

A branch-and-cut approach to the crossing number problem

Published:2008-05 Issue:2 Volume:5 Page:373-388
ISSN:1572-5286
Container-title:Discrete Optimization
language:en
Short-container-title:Discrete Optimization

Author:

Buchheim Christoph,Chimani Markus,Ebner Dietmar,Gutwenger Carsten,Jünger Michael,Klau Gunnar W.,Mutzel Petra,Weiskircher René

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Theoretical Computer Science

Reference46 articles.

1. Computer aided layout of entity-relationship diagrams;Batini;Journal of Systems and Software,1984

2. A framework for solving VLSI graph layout problems;Bhatt;Journal of Computer and System Sciences,1984

3. H. Bodlaender, A. Grigoriev, Algorithms for graphs embeddable with few crossings per edge. Research Memoranda 036, Maastricht: METEOR, Maastricht Research School of Economics of Technology and Organization, 2004

4. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms;Booth;Journal of Computer and System Sciences,1976

5. On the cutting edge: Simplified O(n) planarity by edge addition;Boyer;Journal of Graph Algorithms and Applications,2004

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From the Crossing Numbers of K5 + Pn and K5 + Cn to the Crossing Numbers of Wm + Sn and Wm + Wn;Axioms;2024-06-25

2. Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices;Computer Graphics Forum;2024-05-03

3. The Crossing Numbers of Join of Special Disconnected Graph on Five Vertices with Discrete Graphs;Graphs and Combinatorics;2022-02-01

4. Crossing Minimal Edge‐Constrained Layout Planning using Benders Decomposition;Production and Operations Management;2021-05-26

5. Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics;Lecture Notes in Computer Science;2021