scientific article
From MaRDI portal
Publication:3088453
zbMath1219.05188MaRDI QIDQ3088453
Publication date: 19 August 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Arankings of trees ⋮ Minimal \(k\)-rankings and the rank number of \(P^2_n\) ⋮ Rank numbers of grid graphs ⋮ Minimal rankings and the arank number of a path ⋮ Max-optimal and sum-optimal labelings of graphs
This page was built for publication:
