Pages that link to "Item:Q968161"
From MaRDI portal
The following pages link to On end-vertices of lexicographic breadth first searches (Q968161):
Displaying 11 items.
- End-vertices of LBFS of (AT-free) bigraphs (Q528559) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Recognizing graph search trees (Q2132337) (← links)
- Graph searches and their end vertices (Q2165035) (← links)
- End vertices of graph searches on bipartite graphs (Q2234808) (← links)
- Influence of the tie-break rule on the end-vertex problem (Q2928580) (← links)
- End-Vertices of Graph Search Algorithms (Q2947028) (← links)
- The Recognition Problem of Graph Search Trees (Q4997136) (← links)
- Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition (Q5351862) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710792) (← links)
- Linearizing partial search orders (Q6039439) (← links)