Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,399,327 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
21 relations
Acyclic orientation
Algorithm
Biconnected graph
Depth-first search
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Acyclic orientations with degree constraints
Z. Király
,
Dömötör Pálvölgyi
arXiv.org
2018
Corpus ID: 47017466
In this note we study the complexity of some generalizations of the notion of $st$-numbering. Suppose that given some functions…
Expand
2018
2018
C C ] 9 J un 2 01 8 Acyclic orientations with degree constraints
Z. Király
,
Dömötör Pálvölgyi
2018
Corpus ID: 49206149
In this note we study the complexity of some generalizations of the notion of st-numbering. Suppose that given some functions f…
Expand
2015
2015
A Linear Algorithm for Resource Tripartitioning Triconnected Planar Graphs
Tanveer Awal
,
M. S. Rahman
2015
Corpus ID: 55613487
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…
Expand
2014
2014
Delaunay Triangulation and st-numbering in Wireless Sensor Network topology
M. Sultana
,
Sharifa Rania Mahmud
,
Lazima Ansari
,
N. Khan
International Conference on Electrical…
2014
Corpus ID: 14068217
Significant advances have been made in Wireless Sensor Networks (WSN)s over the last decade. The advances in wireless…
Expand
2014
2014
PiGra- A Tool for Pixelated Graph Representations
Thomas Bläsius
,
Fabian Klute
,
Benjamin Niedermann
,
M. Nöllenburg
2014
Corpus ID: 64611759
At GD 2013 Biedl et al. presented a simple and versatile formulation of grid-based graph representation problems as integer…
Expand
2011
2011
An Application of ST-Numbering to Secret Key Agreement
T. Mizuki
,
Satoru Nakayama
,
H. Sone
International Journal of Foundations of Computer…
2011
Corpus ID: 6390876
Assume that there are players and an eavesdropper Eve, where several pairs of players have shared secret keys beforehand. We…
Expand
2006
2006
On Resource Bipartitioning Problem
Z. Shams
,
S. Ferdous
,
Kazi Zakia Sultana
,
Md. Saidur Rahman
International Conference on Electrical and…
2006
Corpus ID: 14102436
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…
Expand
1995
1995
An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph
Rohan F. M. Aranha
,
C. Rangan
Journal of universal computer science (Online)
1995
Corpus ID: 40926585
1992
1992
Outgoing Edge in the Acyclic Orientation), and the Canonical Ordering for Planar P Long 2 3 F F F
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…
Expand
1984
1984
Centromere orientation, reorientation, and segregation in an interchange quadrivalent during anther development in pearl millet
P. Koduru
Chromosoma
1984
Corpus ID: 12589449
Prometaphase I orientation, reorientation and anaphase I segregational behaviour of a chain-forming interchange quadrivalent…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE