scientific article; zbMATH DE number 7088240
From MaRDI portal
Publication:5226833
zbMATH Open1417.05198arXiv1810.12253MaRDI QIDQ5226833FDOQ5226833
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 of this publication is not available (Why is that?)
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (8)
- A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
- Linearizing partial search orders
- Graph searches and their end vertices
- End vertices of graph searches on bipartite graphs
- Title not available (Why is that?)
- Semi-proper interval graphs
- Graph Search Trees and Their Leaves
- The Recognition Problem of Graph Search Trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226833)
