Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Hypergraphic matroids were studied first by Lorea [23] and later by Frank et al. [11]. They can be seen as generalizations of graphic matroids. Here we show that several algorithms developed for the graphic case can be extended to hypergraphic matroids. We treat the following: the separation problem for the associated polytope, testing independence, separation of partition inequalities, computing the rank of a set, computing the strength, computing the arboricity and network reinforcement.
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
Ruixiong Tian, Zhe Xiang, et al.
Qinghua Daxue Xuebao/Journal of Tsinghua University
Mario Blaum, John L. Fan, et al.
IEEE International Symposium on Information Theory - Proceedings
Amir Ali Ahmadi, Raphaël M. Jungers, et al.
SICON