Influence of the tie-break rule on the end-vertex problem

zbMATH Open1301.05329MaRDI QIDQ2928580FDOQ2928580

Authors: Pierre Charbit, Antoine Mamcarz, Michel Habib 

Publication date: 10 November 2014

Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2519/0.html

Recommendations

• End-vertices of graph search algorithms
• On the end-vertex problem of graph searches
• On end-vertices of lexicographic breadth first searches
• End vertices of graph searches on bipartite graphs
• A tie-break model for graph search

zbMATH Keywords

BFSgraph algorithmsDFSgraph searchLBFSLDFSend-vertex problem

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (12)

• On end-vertices of lexicographic breadth first searches
• The recognition problem of graph search trees
• On the recognition of search trees generated by BFS and DFS
• End-vertices of graph search algorithms
• Recognizing graph search trees
• Linearizing partial search orders
• On the end-vertex problem of graph searches
• Graph searches and their end vertices
• A tie-break model for graph search
• End vertices of graph searches on bipartite graphs
• Graph Search Trees and Their Leaves
• End-vertices of LBFS of (AT-free) bigraphs

Uses Software

• Algorithm 447

This page was built for publication: Influence of the tie-break rule on the end-vertex problem

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