scientific article
From MaRDI portal
Publication:3140414
zbMath0801.68129MaRDI QIDQ3140414
Alejandro A. Schäffer, Raymond Greenlaw, Pilar de la Torre
Publication date: 29 November 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial-time algorithmgraph labeling\({\mathcal P}\)-complete\({\mathcal N}{\mathcal C}\) algorithmoptimal edge ranking
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (5)
Characterizations and algorithmic applications of chordal graph embeddings ⋮ Rankings of graphs ⋮ Arankings of trees ⋮ An optimal parallel algorithm for node ranking of cographs ⋮ On vertex ranking of a starlike graph
This page was built for publication:
