𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case

✍ Scribed by Kubicki, Grzegorz; Morayne, Michal

Book ID
118198906
Publisher
Society for Industrial and Applied Mathematics
Year
2005
Tongue
English
Weight
156 KB
Volume
19
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The Isomorphism Problem For Directed Pat
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
✍ L. Babel; I.N. Ponomarenko; G. Tinhofer πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 237 KB

This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. We prove that deciding isomorphism of directed path

A graph-theoretic generalization of the
A graph-theoretic generalization of the Sauer-Shelah lemma
✍ NicolΓ² Cesa-Bianchi; David Haussler πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 622 KB

We show a natural graph-theoretic generalization of the Sauer-Shelah lemma. This result is applied to bound the & and L1 packing numbers of classes of functions whose range is an arbitrary, totally bounded metric space.