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

DOI10.3233/COM-190285MaRDI QIDQ5859844

Marta Fiori-Carones, Alberto Marcone

Publication date: 18 November 2021

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.01879

zbMATH Keywords

on-line algorithmreverse mathematicscomparability graphsreorientationspseudo-transitive graphs

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Related Items (1)

Primitive recursive reverse mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval graphs and interval orders
• Ordered sets
• Algorithmic graph theory and perfect graphs
• Weihrauch Complexity in Computable Analysis
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Transitiv orientierbare Graphen
• Flots et tensions dans un graphe
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: To reorient is easier than to orient: An on-line algorithm for reorientation of graphs