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)

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

- Therese C. Biedl, Thomas BlÃ¤sius, Benjamin Niedermann, Martin NÃ¶llenburg, Roman Prutkin, Ignaz Rutter
- Graph Drawing
- 2013

We present a simple and versatile formulation of grid-based graph representation problems as an integer linear program (ILP) andâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Reto Gassmann, Ana Carvalho, +5 authors William C Earnshaw
- 2004

he chromosomal passenger complex of Aurora B kinase, INCENP, and Survivin has essential regulatory roles at centromeres and theâ€¦Â (More)

Is this relevant?

2004

2004

- Mohammad Mursalin Akon, Shah Asaduzzaman, Md. Saidur Rahman, Mitsuji Matsumoto
- Telecommunication Systems
- 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)

Is this relevant?

2004

2004

- Yung H. Tsin
- Inf. Process. Lett.
- 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)

Is this relevant?

2001

2001

- Shay Halperin, Uri Zwick
- J. Algorithms
- 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

- Shay Halperin, Uri Zwick
- 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

- Ming-Yang Kao, Philip N. Klein
- STOC
- 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

- Richard B Cole, Uzi Vishkin
- SIAM J. Comput.
- 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

- Yael Maon, Baruch Schieber, Uzi Vishkin
- Aegean Workshop on Computing
- 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?