Publication

Approximating the rectilinear crossing number

János Pach, Andrew Suk
2019
Journal Articles

Abstract

A straight-line drawing of a graph G is a mapping which assigns to each vertex a point in the plane and to each edge a straight-line segment connecting the corresponding two points. The rectilinear crossing number of a graph G, (cr) over bar (G), is the minimum number of pairs of crossing edges in any straight-line drawing of G. Determining or estimating (cr) over bar (G) appears to be a difficult problem, and deciding if (cr) over bar (G)

Official source

https://infoscience.epfl.ch/entities/publication/e471bbf4-9262-427a-8d5b-500fd41852ce

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Approximating the rectilinear crossing number

Chat with Graph Search

The connection of the acyclic disconnection and feedback arc sets - On an open problem of Figueroa et al

The Power of Two Matrices in Spectral Algorithms for Community Recovery

In Medio Stat Virtus: Combining Boolean and Pattern Matching