Pages that link to "Item:Q1763148"
From MaRDI portal
The following pages link to Graph searching, elimination trees, and a generalization of bandwidth (Q1763148):
Displaying 12 items.
- On minimum cost edge searching (Q391138) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Edge-bandwidth of grids and tori (Q861250) (← links)
- Digraph measures: Kelly decompositions, games, and orderings (Q930893) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- Edge searching weighted graphs (Q1026157) (← links)
- Lower bounds on treespan (Q1044709) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Four-searchable biconnected outerplanar graphs (Q2243137) (← links)
- Searching by heterogeneous agents (Q5918998) (← links)
