Linear‐time algorithms for eliminating claws in graphs-Reference-Cited by-同舟云学术

Linear‐time algorithms for eliminating claws in graphs

Published:2021-12-14 Issue: Volume: Page:
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Bonomo‐Braberman Flavia¹,Nascimento Julliano R.²^ORCID,Oliveira Fabiano S.³,Souza Uéverton S.⁴^ORCID,Szwarcfiter Jayme L.³⁵

Affiliation:

1. FCEyN DC./CONICET‐UBA. ICC Universidad de Buenos Aires Viamonte 430, C1053 CABA Buenos Aires Argentina

2. INF Universidade Federal de Goiás Goiás 74690‐90 Brazil

3. IME Universidade do Estado do Rio de Janeiro Rio de Janeiro 20550‐900 Brazil

4. IC Universidade Federal Fluminense Rio de Janeiro 24210‐346 Brazil

5. IM, COPPE, and NCE Universidade Federal do Rio de Janeiro Rio de Janeiro 21941‐901 Brazil

Funder

Agencia Nacional de Promoción Científica y Tecnológica

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior

Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Secretaría de Ciencia y Técnica, Universidad de Buenos Aires

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.13100

Reference35 articles.

1. A partial k-arboretum of graphs with bounded treewidth

2. A $c^k n$ 5-Approximation Algorithm for Treewidth

3. Vertex deletion problems on chordal graphs

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

1. On the d-Claw Vertex Deletion Problem;Algorithmica;2023-07-07