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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2018
02419862018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Recent work by Elmasry et al. (STACS 2015) and Asano et al. (ISAAC 2014) reconsidered classical fundamental graph algorithms… (More)
Is this relevant?
2013
2013
We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) and… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2004
Highly Cited
2004
he chromosomal passenger complex of Aurora B kinase, INCENP, and Survivin has essential regulatory roles at centromeres and the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
A routing protocol chooses one of the several paths (routes) from a source node to a destination node in the computer network, to… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • figure 2
Is this relevant?
2004
2004
An ear decomposition of a connected undirected graph G= (V ,E) is a partition of the edge (link) set E into a collection of edge… (More)
  • figure 1
Is this relevant?
2001
2001
We present the rst randomized O(log n) time and O(m+n) work EREW PRAM algorithm for nding a spanning forest of an undirected… (More)
Is this relevant?
1996
1996
We present the rst randomized O(logn) time and O(m + n) work EREW PRAM algorithm for nding a spanning forest of an undirected… (More)
Is this relevant?
1990
1990
1. I n t roduc t i on . In its simpliest form, the di. graph reachability problem is to test whether a graph contains a directed… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We define a novel scheduling problem; it is solved in parallel by repeated, rapid, approximate reschedulings. This leads to the… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
LEC-67] linear time serial algorithm for testing planarity of graphs uses the linear time serial algorithm of [ET-76] for st… (More)
Is this relevant?