Skip to search formSkip to main contentSkip to account menu

Acyclic orientation

In graph theory, an acyclic orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that does not form any… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
All feasible flows in potential-driven networks induce an orientation on the undirected graph underlying the network. Clearly… 
2017
2017
  • 2017
  • Corpus ID: 125758864
The efficient use of radio spectrum depends upon frequency assignment within a telecommunications network. The solution space of… 
2015
2015
Given a graph, an acyclic orientation of the edges determines a partial ordering of the vertices. This partial ordering has a… 
2005
2005
A flippable edge in an acyclic digraph is an edge whose reorientation leaves the graph acyclic. Flippable edges was recently… 
Review
1998
Review
1998
Sorting problems have long been one of the foundations of theoretical computer science. Sorting problems attempt to learn… 
1996
1996
The computational complexity of the graph isomorphism problem is still unknown. We consider Cartesian products K n K m of two… 
1995
1995
The acyclic orientation graph AO G of an undirected graph G is the graph whose vertices are the acyclic orientations of G and… 
1993
1993
Given a graph G, the acyclic orientation graph of G, denoted AO(G), is the graph whose vertices are the acyclic orientations of G… 
1992
1992
  • 1992
  • Corpus ID: 9090947
triangular graphs 7] (in which every vertex v; v 6 = v 1 ; v 2 ; v n , has 2 incoming and 1 outgoing edge in the acyclic…