Declawing a graph: polyhedra and Branch-and-Cut algorithms-Reference-Cited by-同舟云学术

Declawing a graph: polyhedra and Branch-and-Cut algorithms

Published:2021-04-19 Issue:1 Volume:42 Page:85-124
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Fragoso Felipe C.,de Sousa Filho Gilberto F.^ORCID,Protti Fábio

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-021-00736-y.pdf

Reference24 articles.

1. Aravind NR, Sandeep RB, Sivadasan N (2017) On polynomial kernelization of h-free edge deletion. Algorithmica 79(3):654–666

2. Bastos L, Ochi LS, Protti F, Subramanian A, Martins IC, Pinheiro RGS (2016) Efficient algorithms for cluster editing. J Comb Optim 31(1):347–371

3. van Bevern R, Komusiewicz C, Moser H, Niedermeier R (2010) Measuring indifference: unit interval vertex deletion. In: Thilikos DM (ed) Graph theoretic concepts in computer science. Springer, Heidelberg, pp 232–243

4. Bogart KP, West DB (1999) A short proof that proper = unit. Discret Math 201(1):21–23

5. Bonomo-Braberman F, Nascimento JR, Oliveira FS, Souza US, Szwarcfiter JL (2020) Linear-time algorithms for eliminating claws in graphs. In: Lecture notes in computer science, Springer, Newyork, pp 14–26

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The stochastic pseudo-star degree centrality problem;European Journal of Operational Research;2023-07