Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Cheolwon Heo"'
Publikováno v:
The Electronic Journal of Combinatorics. 30
We show that for every binary matroid $N$ there is a graph $H_*$ such that for the graphic matroid $M_G$ of a graph $G$, there is a matroid-homomorphism from $M_G$ to $N$ if and only if there is a graph-homomorphism from $G$ to $H_*$. With this we pr
Autor:
Bertrand Guenin, Cheolwon Heo
Publikováno v:
Mathematical Programming.
Autor:
Bertrand Guenin, Cheolwon Heo
Publikováno v:
Mathematical Programming.
Autor:
Bertrand Guenin, Cheolwon Heo
Publikováno v:
Mathematical Programming.
Autor:
Cheolwon Heo, Bertrand Guenin
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783030457709
IPCO
IPCO
Even-cycle matroids are elementary lifts of graphic matroids. Even-cut matroids are elementary lifts of cographic matroids. We give a polynomial time algorithm to check if a binary matroid is an even-cycle matroid. We also give a polynomial time algo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a18d2c48e2e82f48bd657eacfcdce7f8
https://doi.org/10.1007/978-3-030-45771-6_15
https://doi.org/10.1007/978-3-030-45771-6_15
Autor:
Guenin, Bertrand1 (AUTHOR) bguenin@uwaterloo.ca, Heo, Cheolwon2 (AUTHOR)
Publikováno v:
Mathematical Programming. Mar2024, Vol. 204 Issue 1/2, p81-111. 31p.
Autor:
Guenin, Bertrand1 (AUTHOR) bguenin@uwaterloo.ca, Heo, Cheolwon2 (AUTHOR)
Publikováno v:
Mathematical Programming. Nov2023, Vol. 202 Issue 1/2, p515-542. 28p.
Autor:
Daniel Bienstock, Giacomo Zambelli
This book constitutes the refereed proceedings of the 21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020, held in London, UK, in June 2020. The 33 full versions of extended abstracts presented were carefull