|
In this paper we generalize source location problems with edge-connectivity requirements on undirected and directed graphs to similar problems on undirected and directed hypergraphs. In the undirected case we consider an abstract framework which contains the source location for undirected hypergraphs as a special case and which can be solved in polynomial time. For the directed case, the asymmetry of the results we get reflects the asymmetry of the model of directed hypergraph we consider.
Bibtex entry:
| AUTHOR | = | {Bern{\'a}th, Attila}, |
| TITLE | = | {Source location in undirected and directed hypergraphs}, |
| NOTE | = | {{\tt egres.elte.hu}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2006}, |
| NUMBER | = | {TR-2006-12} |