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 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Measuring the Complexity of Air Traffic Based on Complex Networks;2024 IEEE 4th International Conference on Electronic Technology, Communication and Information (ICETCI);2024-05-24

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

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

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

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