Strong orientation

Known as: Totally cyclic orientation 
In graph theory, a strong orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that makes it into a… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2011
2011
Researchers have been working to understand the factors that may be contributing to low rates of participation by women and other… (More)
  • table I
  • table II
  • table IV
  • table III
  • table V
Is this relevant?
2008
2008
The concept of forced orientation of graphs was introduced by G. Chartrand et al. in 1994. If, for a given assignment of… (More)
Is this relevant?
2005
2005
Using a semi-empirical, sp3d5s* tight-binding approach and a 'top-of-the-barrier' ballistic FET model, we report full-band… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2001
2001
Vibrational studies that selectively probe molecular structure at CCl4/H2O and hydrocarbon/H2O interfaces show that the hydrogen… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
This paper describes a novel lane detection algorithm for visual traffic surveillance applications under the auspice of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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?
1991
1991
Schimmler, M., Parallel strong orientation on a mesh connected computer, Parallel Computing 17 (1991) 657-664. We present a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Review
1985
Review
1985
The family of models of computation used in this paper is the family of parallel random access machines (PRAMs). All members of… (More)
Is this relevant?
1979
1979
We show that the only nontrivial strongly orientable graphs for which every strong orientation is Hamiltonian are complete graphs… (More)
  • figure 1
Is this relevant?