Computing crossing numbers in quadratic time
作者：
Highlights：
•
摘要
We show that for every fixed k⩾0 there is a quadratic time algorithm that decides whether a given graph has crossing number at most k and, if this is the case, computes a drawing of the graph into the plane with at most k crossings.
论文关键词：
论文评审过程：Received 14 October 2001, Revised 29 November 2002, Available online 15 October 2003.
论文官网地址：https://doi.org/10.1016/j.jcss.2003.07.008
