To reorient is easier than to orient: An on-line algorithm for reorientation of graphs-Reference-Cited by-同舟云学术

To reorient is easier than to orient: An on-line algorithm for reorientation of graphs

Published:2021-07-14 Issue:3 Volume:10 Page:215-233
ISSN:2211-3576
Container-title:Computability
language:
Short-container-title:COM

Author:

Fiori-Carones Marta¹,Marcone Alberto²

Affiliation:

1. Dipartimento di scienze matematiche, informatiche e fisiche, Università di Udine, Via delle Scienze 208, 33100 Udine, Italy. marta.fioricarones@outlook.it

2. Dipartimento di scienze matematiche, informatiche e fisiche, Università di Udine, Via delle Scienze 208, 33100 Udine, Italy. alberto.marcone@uniud.it

Abstract

We define an on-line (incremental) algorithm that, given a (possibly infinite) pseudo-transitive oriented graph, produces a transitive reorientation. This implies that a theorem of Ghouila-Houri is provable in RCA 0 and hence is computably true.

Publisher

IOS Press

Subject

Artificial Intelligence,Computational Theory and Mathematics,Computer Science Applications,Theoretical Computer Science

Reference13 articles.

1. Foundations of online structure theory;Bazhenov;The Bulletin of Symbolic Logic,2019

2. C. Berge, Graphs and Hypergraphs, 2nd edn, North-Holland, Amsterdam, 1976.

3. V. Brattka, G. Gherardi and A. Pauly, Weihrauch complexity in computable analysis, in: Handbook of Computability and Complexity in Analysis, V. Brattka and P. Hertling, eds, Springer, New York, 2021, In press.

4. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 3rd edn, MIT Press, Massachusetts, 2009.

5. P.C. Fishburn, Interval Orders and Interval Graphs, Wiley, New York, 1985.

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

1. Primitive recursive reverse mathematics;Annals of Pure and Applied Logic;2024-01