Pages that link to "Item:Q2706178"
From MaRDI portal
The following pages link to Graph Searching and Interval Completion (Q2706178):
Displaying 15 items.
- On minimum cost edge searching (Q391138) (← links)
- The complexity of minimum-length path decompositions (Q494076) (← links)
- Time constrained graph searching (Q930887) (← links)
- An annotated bibliography on guaranteed graph searching (Q930895) (← links)
- Digraph searching, directed vertex separation and directed pathwidth (Q944735) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- Maximum vertex occupation time and inert fugitive: Recontamination does help (Q987778) (← links)
- On the profile of the corona of two graphs (Q1029099) (← links)
- On the monotonicity of games generated by symmetric submodular functions. (Q1410686) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- On the domination search number (Q1811076) (← links)
- On tradeoffs between width- and fill-like graph parameters (Q1999998) (← links)
- Profile minimization on compositions of graphs (Q2471064) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Network Decontamination with Temporal Immunity by Cellular Automata (Q4931220) (← links)
