Domov > Obvestila > Sergio Cabello: Shortest contractible cycles in embedded graphs

Sergio Cabello: Shortest contractible cycles in embedded graphs

Datum objave: 11. 3. 2008
Vir: Seminar za teorijo grafov in algoritme
Thursday, March 13, 2008, at 12:15 in room PS, Jadranska 19
Carsten Thomassen asked: is there a polynomial time algorithm to find a shortest contractible cycle in a given embedded graph? We will report progress on this problem and other similar problems.