Computing Crossing Numbers in Quadratic Time

Details Computing Crossing Numbers in Quadratic Time Computing Crossing Numbers in Quadratic Time

2000-09-18

arxiv.org/abs/cs/0009010v2

Computer Science

Data Structures and Algorithms

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing Crossing Numbers in Quadratic Time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Crossing Numbers in Quadratic Time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Crossing Numbers in Quadratic Time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-126501