### Abstract

An ear-decomposition of a digraph is a representation of it as the union of (open or closed) directed paths, each having its endpoints in common with the union of the previous paths and nothing else. It is proved that finding an ear-decomposition of a strongly directed graph is in NC, i. e. , an ear-decomposition can be constructed in parallel in polylog time, using a polynomial number of processors. Using a similar technique, it is shown that the problem of finding a minimum-weight spanning arborescence in an arcweighted rooted diagraph is in NC.

Original language | English |
---|---|

Title of host publication | Annual Symposium on Foundations of Computer Science (Proceedings) |

Publisher | IEEE |

Pages | 464-467 |

Number of pages | 4 |

ISBN (Print) | 0818606444 |

Publication status | Published - 1985 |

### Fingerprint

### ASJC Scopus subject areas

- Hardware and Architecture

### Cite this

*Annual Symposium on Foundations of Computer Science (Proceedings)*(pp. 464-467). IEEE.

**COMPUTING EARS AND BRANCHINGS IN PARALLEL.** / Lovász, L.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Annual Symposium on Foundations of Computer Science (Proceedings).*IEEE, pp. 464-467.

}

TY - GEN

T1 - COMPUTING EARS AND BRANCHINGS IN PARALLEL.

AU - Lovász, L.

PY - 1985

Y1 - 1985

N2 - An ear-decomposition of a digraph is a representation of it as the union of (open or closed) directed paths, each having its endpoints in common with the union of the previous paths and nothing else. It is proved that finding an ear-decomposition of a strongly directed graph is in NC, i. e. , an ear-decomposition can be constructed in parallel in polylog time, using a polynomial number of processors. Using a similar technique, it is shown that the problem of finding a minimum-weight spanning arborescence in an arcweighted rooted diagraph is in NC.

AB - An ear-decomposition of a digraph is a representation of it as the union of (open or closed) directed paths, each having its endpoints in common with the union of the previous paths and nothing else. It is proved that finding an ear-decomposition of a strongly directed graph is in NC, i. e. , an ear-decomposition can be constructed in parallel in polylog time, using a polynomial number of processors. Using a similar technique, it is shown that the problem of finding a minimum-weight spanning arborescence in an arcweighted rooted diagraph is in NC.

UR - http://www.scopus.com/inward/record.url?scp=0022201598&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022201598&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0022201598

SN - 0818606444

SP - 464

EP - 467

BT - Annual Symposium on Foundations of Computer Science (Proceedings)

PB - IEEE

ER -