Decomposing a planar graph with girth at least 8 into a forest and a matching
- 作者Yingqian Wang; Qijun Zhang
- 卷第311卷
- 印刷ISSN0012-365X
- 文件大小207.35KB
- 发表时间2011
- DOI10.1016/j.disc.2011.01.019
- 页码844-849
同作者推荐
Approximation algorithms for a facility location problem with service capacitiesMaßberg, Jens; Vygen, Jens · ACM Transactions on Algorithms · 2008
Discrete convex analysisKazuo Murota; Jens Vygen · 2004
New theoretical results on quadratic placementJens Vygen · 2007
Faster algorithm for optimum Steiner treesJens Vygen · 2011
[UNITEXT] Ottimizzazione Combinatoria ||Korte, Bernhard; Vygen, Jens · 2011
[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 ||Korte, Bernhard; Vygen, Jens · 2012
d-dimensional arrangement revisitedRotter, Daniel; Vygen, Jens · Information Processing Letters · 2013