scientific article; zbMATH DE number 1303585
From MaRDI portal
Publication:4250211
zbMath0942.68094MaRDI QIDQ4250211
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (16)
On the tree search problem with non-uniform costs ⋮ A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs ⋮ NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem ⋮ Reversible Pebble Game on Trees ⋮ Pebbling meets coloring: reversible pebble game on trees ⋮ Combinatorial search in two and more rounds ⋮ Edge and pair queries-random graphs and complexity ⋮ On the vertex ranking problem for trapezoid, circular-arc and other graphs ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Easy and hard instances of arc ranking in directed graphs ⋮ Edge ranking and searching in partial orders ⋮ The binary identification problem for weighted trees ⋮ Edge ranking of weighted trees ⋮ On the Tree Search Problem with Non-uniform Costs ⋮ Algorithms for generalized vertex-rankings of partial k-trees
This page was built for publication:
