Pages that link to "Item:Q2676567"
From MaRDI portal
The following pages link to The complexity of searching implicit graphs (Q2676567):
Displaying 8 items.
- A finite set of functions with an EXPTIME-complete composition problem (Q955009) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
- A framework for analysing state-abstraction methods (Q2060741) (← links)
- The complexity of searching a graph (Q3777477) (← links)
- (Q4608582) (← links)
- Implicit Component-Graph: A Discussion (Q5270553) (← links)
- Representing graphs implicitly using almost optimal space (Q5928875) (← links)