Measuring the complexity of directed graphs: A polynomial-based approach-Reference-Cited by-同舟云学术

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

Measuring the complexity of directed graphs: A polynomial-based approach

Published:2019-11-14 Issue:11 Volume:14 Page:e0223745
ISSN:1932-6203
Container-title:PLOS ONE
language:en
Short-container-title:PLoS ONE

Author:

Dehmer Matthias^ORCID,Chen Zengqiang,Emmert-Streib Frank,Tripathi Shailesh,Mowshowitz Abbe,Levitchi Alexei^ORCID,Feng Lihua,Shi Yongtang,Tao Jin^ORCID

Funder

1. NFSC; 2. Natural Science Foundation of Hunan Province

Austrian Science Funds

Publisher

Public Library of Science (PLoS)

Subject

Multidisciplinary

Reference37 articles.

1. Digraph complexity measures and applications in formal language theory;H Gruber;Discrete Mathematics & Theoretical Computer Science,2012

2. DAG-width—connectivity measure for directed graphs;J Obdržálek;Symposium on Discrete Algorithms, ACM-SIAM,2006

3. The Geography of Transport Systems

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

1. Fuzzy Networks for Modeling Shared Semantic Knowledge;Journal of Artificial General Intelligence;2023-03-01

2. Mapping Modern JVM Language Code to Analysis-Friendly Graphs: A Study with Kotlin;International Journal of Software Engineering and Knowledge Engineering;2022-11

3. First-Year Engineering Students’ Strategies for Taking Exams;International Journal of Artificial Intelligence in Education;2022-08-02

4. Sombor index of directed graphs;Heliyon;2022-03

5. Estimation of most effected cycles and busiest network route based on complexity function of graph in fuzzy environment;Artificial Intelligence Review;2022-01-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP