# Strong orientation

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2018

2018

- Algorithmica
- 2018

We examine the complexity of the online Dictionary Matching with One Gap Problem (DMOG) which is the following. Preprocess aâ€¦Â (More)

Is this relevant?

2011

2011

- TOCE
- 2011

Researchers have been working to understand the factors that may be contributing to low rates of participation by women and otherâ€¦Â (More)

Is this relevant?

2008

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

- IEEE InternationalElectron Devices Meetingâ€¦
- 2005

Using a semi-empirical, sp3d5s* tight-binding approach and a 'top-of-the-barrier' ballistic FET model, we report full-bandâ€¦Â (More)

Is this relevant?

2001

2001

- Science
- 2001

Vibrational studies that selectively probe molecular structure at CCl4/H2O and hydrocarbon/H2O interfaces show that the hydrogenâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- IEEE Trans. Systems, Man, and Cybernetics, Part B
- 2000

This paper describes a novel lane detection algorithm for visual traffic surveillance applications under the auspice ofâ€¦Â (More)

Is this relevant?

1997

1997

- SODA
- 1997

Russ Bubley* Graph orientation problems have a long pedigree both in pure mathematics and theoretical computer science. Weâ€¦Â (More)

Is this relevant?

1991

1991

- Parallel Computing
- 1991

Schimmler, M., Parallel strong orientation on a mesh connected computer, Parallel Computing 17 (1991) 657-664. We present aâ€¦Â (More)

Is this relevant?

Review

1985

Review

1985

- Inf. Process. Lett.
- 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

- Journal of Graph Theory
- 1979

We show that the only nontrivial strongly orientable graphs for which every strong orientation is Hamiltonian are complete graphsâ€¦Â (More)

Is this relevant?