Orientation

Known as: Graph orientation, Oriented graph 
In graph theory, an orientation of an undirected graph is an assignment of a direction to each edge, turning the initial graph into a directed graph.
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2013
0119962013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In a previous study we proceeded to the remodularization architecture based on classes and packages using the Formal Concept… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2014
2014
Flows over time are used to model many real-world logistic and routing problems. The networks underlying such problems – streets… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
Graph orientation is a well-studied area of graph theory. A proper orientation of a graph G = (V,E) is an orientationD of E(G… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
  • Michael Elberfelda, Danny Segevb, Colin R. Davidsonc, Dana Silverbushd, Roded Sharand
  • 2012
Graph orientation is a fundamental problem in graph theory that has recently arisen in the study of signaling-regulatory pathways… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
Graph orientation is a fundamental problem in graph theory that has recently arisen in the study of signaling-regulatory pathways… (More)
  • figure 1
Is this relevant?
2009
2009
We study a new a variant of the graph orientation problem called MAXMINO where the input is an undirected, edge-weighted graph… (More)
Is this relevant?
2003
2003
Graph orientation is a well-studied area of combinatorial optimization, one that provides a link between directed and undirected… (More)
Is this relevant?
Review
2001
Review
2001
An oriented k-coloring of an oriented graph G (that is a digraph with no cycle of length 2) is a partition of its vertex set into… (More)
Is this relevant?
1997
1997
Russ Bubley* Graph orientation problems have a long pedigree both in pure mathematics and theoretical computer science. We… (More)
  • figure 1
  • figure 2
Is this relevant?
1996
1996
In our contribution we demonstrate, that orientation (OR) and ocular dominance (OD) cannot develop simultaneously in linear… (More)
  • table I
  • figure 2
  • figure 3
Is this relevant?