A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs-Reference-Cited by-同舟云学术

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

A Note on Enumeration of 3-Edge-Connected Spanning Subgraphs in Plane Graphs

Published:2021-03-01 Issue:3 Volume:E104.D Page:389-391
ISSN:0916-8532
Container-title:IEICE Transactions on Information and Systems
language:en
Short-container-title:IEICE Trans. Inf. & Syst.

Author:

MATSUI Yasuko¹,OZEKI Kenta²

Affiliation:

1. School of Science, Tokai University

2. Faculty of Environment and Information Sciences, Yokohama National University

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Artificial Intelligence,Electrical and Electronic Engineering,Computer Vision and Pattern Recognition,Hardware and Architecture,Software

Link

https://www.jstage.jst.go.jp/article/transinf/E104.D/3/E104.D_2020FCL0002/_pdf

Reference8 articles.

1. [1] D. Avis and K. Fukuda, “Reverse search for enumeration,” Discrete Appl. Math., vol.65, no.1-3, pp.21-46, 1996. 10.1016/0166-218x(95)00026-n

2. [2] A. Conte, M.M. Kanté, Y Otachi, T. Uno, and K. Wasa, “Efficient enumeration of maximal k-degenerate subgraphs in a chordal graph,” Proc. 23th Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, vol.10392, pp.150-161, Springer, 2017. 10.1007/978-3-319-62389-4_13

3. [3] H.N. Gabow, “A matroid approach to finding edge connectivity and packing arborescences,” J. Computer and System Sciences, vol.50, no.2, pp.259-273, 1995. 10.1006/jcss.1995.1022

4. [4] L. Khachiyan, E. Boros, K. Borys, K. Elbassioni, V. Gurvich, and K. Makino, “Enumerating spanning and connected subsets in graphs and matroids,” Proc. 14th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, vol.4168, pp.444-455, Springer, 2006. 10.1007/11841036_41

5. [5] K. Mehlhorn, A. Neumann, and J.M. Schmidt, “Certifying 3-edge-connectvity,” Algorithmica, vol.77, pp.309-335, 2017. 10.1007/s00453-015-0075-x

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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