Searching expenditure and interval graphs
From MaRDI portal
Publication:4242800
Recommendations
Cites work
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 3819512 (Why is no real title available?)
- scientific article; zbMATH DE number 3780976 (Why is no real title available?)
- scientific article; zbMATH DE number 176249 (Why is no real title available?)
- scientific article; zbMATH DE number 3590298 (Why is no real title available?)
- scientific article; zbMATH DE number 1151792 (Why is no real title available?)
- Eavesdropping games
- Fugitive-search games on graphs and related parameters
- Monotonicity in graph searching
- On minimizing width in linear layouts
- Optimal Algorithms for a Pursuit-Evasion Problem in Grids
- Recontamination does not help to search a graph
- Searching and pebbling
- The complexity of searching a graph
- The total vertex separation number and profile of a graph
- The vertex separation and search number of a graph
- Topological Bandwidth
This page was built for publication: Searching expenditure and interval graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242800)