scientific article
From MaRDI portal
Publication:2934603
zbMath1302.68208MaRDI QIDQ2934603
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Online Priority Steiner Tree Problems ⋮ A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry ⋮ The Bursty Steiner Tree Problem ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems
This page was built for publication:
