Edge ranking and searching in partial orders

@article{Dereniowski2008EdgeRA,
  title={Edge ranking and searching in partial orders},
  author={Dariusz Dereniowski},
  journal={Discrete Applied Mathematics},
  year={2008},
  volume={156},
  pages={2493-2500}
}
We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farchi and Newman considered a special case where the partial order has the maximum element and the Hasse diagram is a tree (tree-like posets) and they gave an O(n^4log^3n)-time algorithm for finding an optimal search strategy for such a partial order. We show that this problem is equivalent to finding edge ranking of a… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 10 REFERENCES

Optimal Edge Ranking of Trees in Linear Time

  • Algorithmica
  • 1998
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Edge ranking of weighted trees

  • Discrete Applied Mathematics
  • 2006
VIEW 2 EXCERPTS

Edge Ranking of Graphs Is Hard

  • Discrete Applied Mathematics
  • 1998
VIEW 1 EXCERPT

Minimum Average Cost Testing for Partially Ordered Components

  • Proceedings. IEEE International Symposium on Information Theory
  • 1993
VIEW 1 EXCERPT

Parallel assembly of modular products - an analysis

A. V. Iyer, H. D. Ratliff, G. Vijayan
  • Tech. Report 88-06, Georgia Institute of Technology
  • 1988
VIEW 1 EXCERPT

Reducibility Among Combinatorial Problems

  • Complexity of Computer Computations
  • 1972
VIEW 1 EXCERPT