Skip to Main content Skip to Navigation
Conference papers

A polynomial Turing kernel to compute the cut-width of semi-complete digraph

Christophe Paul 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02078882
Contributor : Christophe Paul <>
Submitted on : Monday, March 25, 2019 - 4:41:54 PM
Last modification on : Wednesday, August 28, 2019 - 1:34:00 PM

Identifiers

  • HAL Id : lirmm-02078882, version 1

Collections

Citation

Christophe Paul. A polynomial Turing kernel to compute the cut-width of semi-complete digraph. FILOFOCS: French-Israeli Workshop on Foundations of Computer Science, Oct 2018, Paris, France. ⟨lirmm-02078882⟩

Share

Metrics

Record views

55