Optimal edge ranking of trees in polynomial time
type: Item
instance of: scholarly article
title: Optimal edge ranking of trees in polynomial time
zbMATH Open document ID: 0826.68093
DOI: 10.1007/BF01189071
author: Pilar de la Torre
author: Alejandro A. Schäffer
author: Raymond Greenlaw
published in: Algorithmica
publication date: 1995-06-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 765173
zbMATH Keywords: edge ranking
zbMATH Keywords: height edge-separator tree
zbMATH Keywords: trees
MaRDI profile type: Publication
cites work: The Parallel Evaluation of General Arithmetic Expressions
cites work: Parallel Merge Sort
cites work: Q5284078
cites work: Q4198056
cites work: The maximum flow problem is log space complete for P
cites work: Q4843270
cites work: Optimal node ranking of trees
cites work: On an edge ranking problem of trees and graphs
cites work: The node-deletion problem for hereditary properties is NP-complete
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: On the complexity of edge labelings for trees
cites work: Optimal node ranking of tree in linear time
cites work: Node-Deletion Problems on Bipartite Graphs
cites work: Edge-Deletion Problems
cites work: Q4886041
full work available at URL: https://doi.org/10.1007/bf01189071
OpenAlex ID: W2079306236
description: scientific article; zbMATH DE number 765173