An Algorithm for Finding a Minimal Equivalent Graph of a Digraph-Reference-Cited by-同舟云学术

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

An Algorithm for Finding a Minimal Equivalent Graph of a Digraph

Published:1975-01 Issue:1 Volume:22 Page:11-16
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Hsu Harry T.¹

Affiliation:

1. Department of Computer Science, Colorado State University, Fort Collins, Colorado

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference3 articles.

1. An Algorithm for Finding a Minimum Equivalent Graph of a Digraph

2. A Theorem on Boolean Matrices

3. BERZTISS A T Data Structures. Academic Press New York 1971. BERZTISS A T Data Structures. Academic Press New York 1971.

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

1. The ultrametric backbone is the union of all minimum spanning forests;Journal of Physics: Complexity;2024-08-08

2. Computing all persistent subspaces of a reaction-diffusion system;Scientific Reports;2023-10-11

3. Taming transitive redundancy for context-free language reachability;Proceedings of the ACM on Programming Languages;2022-10-31

4. Optimality of syntactic dependency distances;Physical Review E;2022-01-18

5. Operations over Lightweight Ontologies and Their Implementation;Implicit and Explicit Semantics Integration in Proof-Based Developments of Discrete Systems;2020-07-28

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP