Counting independent sets in graphs with bounded bipartite pathwidth-Reference-Cited by-同舟云学术

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

Counting independent sets in graphs with bounded bipartite pathwidth

Published:2021-03-10 Issue:2 Volume:59 Page:204-237
ISSN:1042-9832
Container-title:Random Structures & Algorithms
language:en
Short-container-title:Random Struct Alg

Author:

Dyer Martin¹,Greenhill Catherine²,Müller Haiko¹

Affiliation:

1. School of Computing University of Leeds Leeds UK

2. School of Mathematics and Statistics UNSW Sydney Sydney New South Wales Australia

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/rsa.21003

Reference46 articles.

1. On the Markov Chain Simulation Method for Uniform Combinatorial Distributions and Simulated Annealing

2. Polynomial algorithm for finding the largest independent sets in graphs without forks

3. N.Anari K.Liu andS. O.Gharan Spectral independence in high‐dimensional expanders and applications to the hardcore model Proceedings of the 61st Annual Symposium on Foundations of Computer Science (FOCS 2020) IEEE 2020.

4. Combinatorics and Complexity of Partition Functions

5. Computing the Partition Function of a Polynomial on the Boolean Cube

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP