Computationally Tractable Classes of Ordered Sets

Author:

Möhring Rolf H.

Publisher

Springer Netherlands

Reference152 articles.

1. A.V. Aho, M.R. Garey and J.D. Ullman (1972) ‘The transitive reduction of a directed graph’, SIAM J. Comput. 1, 131–137

2. A.V. Aho, J.E. Hopcroft and J.D. Ullman (1975) The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Ma.

3. M.D. Atkinson (1989) ‘The complexity of orders’, this volume

4. M.D. Atkinson and H.W. Chang (1986) ‘Extensions of partial orders of bounded width’, Congressus Num. 52, 21–35

5. K.A. Baker, P.C. Fishburn and F.S. Roberts (1971) ‘Partial orders of dimension 2’ Networks 2, 11–28

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

1. A System of Interaction and Structure III: The Complexity of BV and Pomset Logic;Logical Methods in Computer Science;2023-12-18

2. Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines;Journal of Scheduling;2023-07-17

3. Sequential Scheduling of Dataflow Graphs for Memory Peak Minimization;Proceedings of the 24th ACM SIGPLAN/SIGBED International Conference on Languages, Compilers, and Tools for Embedded Systems;2023-06-13

4. Software science view on quantum circuit algorithms;Information and Computation;2023-06

5. A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem;Mathematics of Operations Research;2022-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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