scientific article; zbMATH DE number 2080258
From MaRDI portal
Publication:4472509
zbMath1044.68702MaRDI QIDQ4472509
Hideyuki Uehara, Yuichiro Itatsu, Mitsuo Yokoyama, Hiro Ito, Motoyasu Ito
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690338.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Source location problems considering vertex-connectivity and edge-connectivity simultaneously ⋮ Static and dynamic source locations in undirected networks ⋮ The root location problem for arc-disjoint arborescences ⋮ The source location problem with local 3-vertex-connectivity requirements ⋮ Minimum cost source location problem with vertex-connectivity requirements in digraphs
This page was built for publication:
