Skip to search formSkip to main contentSkip to account menu

Bipolar orientation

Known as: St-numbering, St-orientation 
In graph theory, a bipolar orientation or st-orientation of an undirected graph is an assignment of a direction to each edge (an orientation) that… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this note we study the complexity of some generalizations of the notion of $st$-numbering. Suppose that given some functions… 
2018
2018
In this note we study the complexity of some generalizations of the notion of st-numbering. Suppose that given some functions f… 
2015
2015
Given a connected graph G = (V, E), a set Vr ⊆ V of r special vertices, three distinct base vertices u1, u2, u3 ∈ V and three… 
2014
2014
Significant advances have been made in Wireless Sensor Networks (WSN)s over the last decade. The advances in wireless… 
2014
2014
At GD 2013 Biedl et al. presented a simple and versatile formulation of grid-based graph representation problems as integer… 
2011
2011
Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We… 
2006
2006
Given a connected graph G = (V, E), two distinct base vertices u <sub>1</sub>, u<sub>2</sub> isin V, a set V<sub>r</sub> sube V… 
1995
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… 
1984
1984
Prometaphase I orientation, reorientation and anaphase I segregational behaviour of a chain-forming interchange quadrivalent…