Computing Crossing Numbers in Quadratic Time
数据结构与算法
2007-05-23 v2 离散数学
摘要
We show that for every fixed non-negative integer k 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 in the plane with at most k crossings.
引用
@article{arxiv.cs/0009010,
title = {Computing Crossing Numbers in Quadratic Time},
author = {Martin Grohe},
journal= {arXiv preprint arXiv:cs/0009010},
year = {2007}
}