scientific article; zbMATH DE number 1303585
From MaRDI portal
Publication:4250211
Recommendations
Cited in
(26)- Optimal node ranking of trees
- Algorithms for generalized vertex-rankings of partial k-trees
- The binary identification problem for weighted trees
- Optimal node ranking of tree in linear time
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs
- Pebbling meets coloring: reversible pebble game on trees
- Combinatorial search in two and more rounds
- Easy and hard instances of arc ranking in directed graphs
- Edge ranking of weighted trees
- On the tree search problem with non-uniform costs
- On the tree search problem with non-uniform costs
- scientific article; zbMATH DE number 437538 (Why is no real title available?)
- Reversible pebble game on trees
- Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
- Improved approximation algorithms for the average-case tree searching problem
- scientific article; zbMATH DE number 910867 (Why is no real title available?)
- Optimal edge ranking of complete bipartite graphs in polynomial time
- Parallel Processing and Applied Mathematics
- Optimal edge ranking of trees in linear time
- Edge and pair queries-random graphs and complexity
- On the complexity of searching in trees and partially ordered structures
- Partial order multiway search
- On an edge ranking problem of trees and graphs
- NP-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
- Edge ranking and searching in partial orders
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250211)
