Connected searching of weighted trees
From MaRDI portal
Publication:719311
DOI10.1016/j.tcs.2011.06.017zbMath1235.68117OpenAlexW1617857752MaRDI QIDQ719311
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.017
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (7)
Approximate search strategies for weighted trees ⋮ Network decontamination under \(m\)-immunity ⋮ Connected graph searching ⋮ On-line search in two-dimensional environment ⋮ Searching by heterogeneous agents ⋮ Finding small-width connected path decompositions in polynomial time ⋮ Distributed graph searching with a sense of direction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connected graph searching
- An annotated bibliography on guaranteed graph searching
- Connected graph searching in chordal graphs
- A graph search algorithm for indoor pursuit/evasion
- Edge searching weighted graphs
- Sweeping graphs with large clique number
- A concise survey of scheduling with time-dependent processing times
- Searching and pebbling
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- From Pathwidth to Connected Pathwidth
- Decontamination of hypercubes by mobile agents
- Capturing an Intruder in the Pyramid
- Connected Graph Searching in Outerplanar Graphs
- DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS
- Connected Treewidth and Connected Graph Searching
- Connected Searching of Weighted Trees
- Scheduling deteriorating jobs to minimize makespan
- Pathwidth is NP-Hard for Weighted Trees
- BOUNDARY-OPTIMAL TRIANGULATION FLOODING
This page was built for publication: Connected searching of weighted trees
