Pages that link to "Item:Q5949570"

The following pages link to Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (Q5949570):

Displayed 2 items.

• A model classifying algorithms as inherently sequential with applications to graph searching (Q1187028) ‎ (← links)
• Depth-First Search Using $$O(n)$$ Bits (Q2942660) ‎ (← links)