Pages that link to "Item:Q617648"
From MaRDI portal
The following pages link to A general label search to investigate classical graph search algorithms (Q617648):
Displaying 5 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Computing a clique tree with the algorithm maximal label search (Q1662609) (← links)
- On the recognition of search trees generated by BFS and DFS (Q2087463) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
