New polynomial delay bounds for maximal subgraph enumeration by proximity search
Author:
Affiliation:
1. National Institute of Informatics, Japan / University of Pisa, Italy
2. National Institute of Informatics, Japan
Publisher
ACM
Link
https://dl.acm.org/doi/pdf/10.1145/3313276.3316402
Reference33 articles.
1. Reverse search for enumeration
2. Optimal output-sensitive convex hull algorithms in two and three dimensions
3. Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes;Discrete Applied Mathematics;2024-03
2. Proximity Search for Maximal Subgraph Enumeration;SIAM Journal on Computing;2022-10-28
3. Linear-Delay Enumeration for Minimal Steiner Problems;Proceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2022-06-12
4. Efficient Algorithms for Maximal k-Biplex Enumeration;Proceedings of the 2022 International Conference on Management of Data;2022-06-10
5. A Polynomial Delay Algorithm for Enumerating 2-Edge-Connected Induced Subgraphs;IEICE Transactions on Information and Systems;2022-03-01
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3