String graphs and incomparability graphs

János Pach
2012
Article

Résumé

Given a collection C of curves in the plane, its string graph is defined as the graph with vertex set C, in which two curves in C are adjacent if and only if they intersect. Given a partially ordered set (P,

Source officielle

https://infoscience.epfl.ch/record/178284?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

String graphs and incomparability graphs

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

Maximum Independent Set: Self-Training through Dynamic Programming

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

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

ON THE INDEPENDENCE NUMBER OF INTERSECTION GRAPHS OF AXIS-PARALLEL SEGMENTS

Maximum Independent Set: Self-Training through Dynamic Programming