On the end-vertex problem of graph searches

zbMATH Open1417.05198arXiv1810.12253MaRDI QIDQ5226833FDOQ5226833

Authors: Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaž Krnc, Nevena Pivač, Robert Scheffler, Martin Strehler 

Publication date: 1 August 2019

Full work available at URL: https://arxiv.org/abs/1810.12253

Recommendations

• End-vertices of graph search algorithms
• End vertices of graph searches on bipartite graphs
• Influence of the tie-break rule on the end-vertex problem
• End-vertices of LBFS of (AT-free) bigraphs
• The recognition problem of graph search trees

zbMATH Keywords

graph classesgraph searchend-vertexmaximum cardinality searchmaximal neighborhood search

Mathematics Subject Classification ID

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: On the end-vertex problem of graph searches

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5226833)