On minimum bisection and related cut problems in trees and tree-like graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

On minimum bisection and related cut problems in trees and tree-like graphs

Published:2018-04-20 Issue:2 Volume:89 Page:214-245
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Fernandes Cristina G.¹^ORCID,Schmidt Tina Janne²^ORCID,Taraz Anusch²^ORCID

Affiliation:

1. Instituto de Matemática e Estatística; Universidade de São Paulo; Rua do Matão 1010 05508-090 São Paulo Brazil

2. Institut für Mathematik; TU Hamburg; Am Schwarzenberg-Campus 3E 21073 Hamburg Germany

Funder

Deutscher Akademischer Austauschdienst

Evangelisches Studienwerk Villigst e.V.

Fundação de Amparo à Pesquisa do Estado de São Paulo

Conselho Nacional de Desenvolvimento Científico e Tecnológico

PROBRAL CAPES/DAAD

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1002/jgt.22248/fullpdf

Reference19 articles.

1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebraic Discrete Methods,1987

2. Polynomial time approximation schemes for dense instances of NP-hard problems;Arora;J. Comp. Syst. Sci.,1999

3. A linear-time algorithm for finding tree-decompositions of small treewidth;Bodlaender;SIAM J. Comp.,1996

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

1. Approximating Spanning Tree Congestion on Graphs with Polylog Degree;Lecture Notes in Computer Science;2024

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP