Proximity Search for Maximal Subgraph Enumeration-Reference-Cited by-同舟云学术

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

Proximity Search for Maximal Subgraph Enumeration

Published:2022-10-28 Issue:5 Volume:51 Page:1580-1625
ISSN:0097-5397
Container-title:SIAM Journal on Computing
language:en
Short-container-title:SIAM J. Comput.

Author:

Conte Alessio¹^ORCID,Grossi Roberto¹,Marino Andrea²,Uno Takeaki³,Versari Luca⁴

Affiliation:

1. Department of Computer Science, University of Pisa, Pisa, Italy (, ).

2. Department of Statistics, Computer Science, and Applications, University of Florence, Florence, Italy ().

3. National Institute of Informatics, Tokyo, Japan ().

4. University of Pisa, Pisa, Italy. Current address: Google Research, Zurich, Switzerland ().

Funder

Japan Science and Technology Agency

Italian Ministry for Education and Research

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Subject

General Mathematics,General Computer Science

Reference36 articles.

1. Reverse search for enumeration

2. An Introduction to Chordal Graphs and Clique Trees

3. Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n

4. Efficiently enumerating minimal triangulations

5. Optimal output-sensitive convex hull algorithms in two and three dimensions

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

1. Traversing Combinatorial 0/1-Polytopes via Optimization;SIAM Journal on Computing;2024-09-09

2. Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints;Lecture Notes in Computer Science;2024

3. Traversing combinatorial 0/1-polytopes via optimization;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Maximum dissociation sets in subcubic trees;Journal of Combinatorial Optimization;2023-08

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3