Pages that link to "Item:Q2449128"
From MaRDI portal
The following pages link to The complexity of pebbling reachability and solvability in planar and outerplanar graphs (Q2449128):
Displaying 6 items.
- Pebbling in 2-paths (Q324757) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- The weight function lemma for graph pebbling (Q2410088) (← links)
- Graph pebbling algorithms and Lemke graphs (Q2416420) (← links)
- An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q3459899) (← links)
- An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs (Q4973896) (← links)