scientific article; zbMATH DE number 1471731
From MaRDI portal
Publication:4488859
DOI<195::AID-NET3>3.0.CO;2-I 10.1002/(SICI)1097-0037(200005)35:3<195::AID-NET3>3.0.CO;2-IzbMath0963.90067MaRDI QIDQ4488859
No author found.
Publication date: 9 July 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
An annotated bibliography on guaranteed graph searching ⋮ The edge-orientation problem and some of its variants on weighted graphs
Cites Work
- Unnamed Item
- Unnamed Item
- An O(\(n\)) time algorithm for maximum matching on cographs
- Clustering and domination in perfect graphs
- Complement reducible graphs
- Single step graph search problem
- An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
- An optimal algorithm for solving the searchlight guarding problem on weighted two-terminal series-parallel graphs
- Searching and pebbling
- The Searchlight Scheduling Problem
- A Linear Recognition Algorithm for Cographs
- The complexity of searching a graph
- Searching for a Mobile Intruder in a Polygonal Region
This page was built for publication:
