Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Natale, Marco V."'
Haj\'os' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps, heuristics and integer programming techniques that enable us to verify Haj\'os' conjecture for
Externí odkaz:
http://arxiv.org/abs/1705.08724
Autor:
Jung, Matthias, Mathew, Deepak M., Weis, Christian, Wehn, Norbert, Heinrich, Irene, Natale, Marco V., Krumke, Sven O.
Publikováno v:
ACM International Conference Proceeding Series; 10/3/2016, p257-267, 11p
