To reorient is easier than to orient: an on-line algorithm for reorientation of graphs
Logic
2023-01-03 v2 Logic in Computer Science
Combinatorics
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.
Keywords
Cite
@article{arxiv.1910.01879,
title = {To reorient is easier than to orient: an on-line algorithm for reorientation of graphs},
author = {Marta Fiori-Carones and Alberto Marcone},
journal= {arXiv preprint arXiv:1910.01879},
year = {2023}
}
Comments
Only minor (non mathematical) changes introduced. To appear in Computability