scientific article; zbMATH DE number 7088240
From MaRDI portal
Publication:5226833
zbMath1417.05198arXiv1810.12253MaRDI QIDQ5226833
Martin Strehler, Jesse Beisegel, Robert Scheffler, Carolin Denkert, Ekkehard Köhler, Nevena Pivač, Matjaž Krnc
Publication date: 1 August 2019
Full work available at URL: https://arxiv.org/abs/1810.12253
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)
Graph searches and their end vertices ⋮ Linearizing partial search orders ⋮ Unnamed Item ⋮ End vertices of graph searches on bipartite graphs ⋮ The Recognition Problem of Graph Search Trees
This page was built for publication: