The following pages link to Bandwidth and pebbling (Q1838912):
Displaying 5 items.
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- Lower bounds on treespan (Q1044709) (← links)
- Complete problems for space bounded subclasses of NP (Q1064779) (← links)
- Min Cut is NP-complete for edge weighted trees (Q1111019) (← links)
- Searching and pebbling (Q1821562) (← links)
