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
The original publication is available at www.springerlink.com : Parallel comparability graph recogni...
Orienter un graphe c'est remplacer chaque arête par un arc de mêmes extrémités. On s'intéresse à la ...
Abstract. We consider two problems pertaining to P4-comparability graphs, namely, the problem of rec...
AbstractA transitive orientation of an undirected graph is an assignment of directions to its edges ...
AbstractWe discuss several results concerning on-line algorithms for ordered sets and comparability ...
Given a transitive orientation G → of a comparability graph G, a vertex of G is a source (sink) if i...
AbstractMa and Spinrad have shown that every transitive orientation of a chordal comparability graph...
Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure...
A module of an undirected graph is a set X of nodes such for each node x not in X , either every mem...
A comparability graph is a graph whose edges can be oriented transitively. Given a comparability gra...
A graph Gs = (V,Es) is a sandwich for a pair of graphs Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. A s...
AbstractA graph is a P4-comparability graph if it admits an acyclic orientation of its edges which i...
Abstract. We develop a new framework for investigating linear equivalence of di-visors on graphs usi...
AbstractA graph Gs=(V,Es) is a sandwich for a pair of graphs Gt=(V,Et) and G=(V,E) if Et⊆Es⊆E. A san...
International audienceBy making use of lexicographic breadth first search, Lex-BFS and partition ref...
The original publication is available at www.springerlink.com : Parallel comparability graph recogni...
Orienter un graphe c'est remplacer chaque arête par un arc de mêmes extrémités. On s'intéresse à la ...
Abstract. We consider two problems pertaining to P4-comparability graphs, namely, the problem of rec...
AbstractA transitive orientation of an undirected graph is an assignment of directions to its edges ...
AbstractWe discuss several results concerning on-line algorithms for ordered sets and comparability ...
Given a transitive orientation G → of a comparability graph G, a vertex of G is a source (sink) if i...
AbstractMa and Spinrad have shown that every transitive orientation of a chordal comparability graph...
Partial Reversal (PR) is a link reversal algorithm which ensures that the underlying graph structure...
A module of an undirected graph is a set X of nodes such for each node x not in X , either every mem...
A comparability graph is a graph whose edges can be oriented transitively. Given a comparability gra...
A graph Gs = (V,Es) is a sandwich for a pair of graphs Gt = (V,Et) and G = (V,E) if Et ⊆ Es ⊆ E. A s...
AbstractA graph is a P4-comparability graph if it admits an acyclic orientation of its edges which i...
Abstract. We develop a new framework for investigating linear equivalence of di-visors on graphs usi...
AbstractA graph Gs=(V,Es) is a sandwich for a pair of graphs Gt=(V,Et) and G=(V,E) if Et⊆Es⊆E. A san...
International audienceBy making use of lexicographic breadth first search, Lex-BFS and partition ref...
The original publication is available at www.springerlink.com : Parallel comparability graph recogni...
Orienter un graphe c'est remplacer chaque arête par un arc de mêmes extrémités. On s'intéresse à la ...
Abstract. We consider two problems pertaining to P4-comparability graphs, namely, the problem of rec...
DOI
Add to ORKG