DeepAI
Log In Sign Up

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

10/04/2019
by   Marta Fiori-Carones, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

02/13/2022

Pseudo-finiteness of arbitrary graphs of bounded shrub-depth

We consider classes of arbitrary (finite or infinite) graphs of bounded ...
06/04/2018

Strong Pseudo Transitivity and Intersection Graphs

A directed graph G=(V,E) is strongly pseudo transitive if there is a pa...
01/23/2020

Arrangements of Approaching Pseudo-Lines

We consider arrangements of n pseudo-lines in the Euclidean plane where ...
04/17/2018

Ruitenburg's Theorem via Duality and Bounded Bisimulations

For a given intuitionistic propositional formula A and a propositional v...
11/15/2018

Cops and robbers on oriented graphs

We consider the well-studied cops and robbers game in the context of ori...
05/23/2018

Coded Caching via Line Graphs of Bipartite Graphs

We present a coded caching framework using line graphs of bipartite grap...
04/07/2021

A Cycle Joining Construction of the Prefer-Max De Bruijn Sequence

We propose a novel construction for the well-known prefer-max De Bruijn ...