Inapproximability of Edge-Disjoint Paths and low congestion routing on undirected graphs
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
págs. 485-520
Every rayless graph has an unfriendly partition
Henning Bruhn, Reinhard Diestel, Agelos Georgakopoulos, Philipp Sprüssel
págs. 521-532
Approximation algorithms via contraction decomposition
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar
págs. 533-552
págs. 553-563
Non-separating even cycles in highly connected graphs
Shinya Fujita, Ken-ichi Kawarabayashi
págs. 565-580
págs. 581-615
© 2008-2024 Fundación Dialnet · Todos los derechos reservados