Conference paper
Bonding, interfacial effects and adhesion in dlc
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
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.
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
Y.Y. Li, K.S. Leung, et al.
J Combin Optim
T. Graham, A. Afzali, et al.
Microlithography 2000
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991