Author:
Kashiwabara Kenji,Okamoto Yoshio,Uno Takeaki
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. L. Cai, D. Corneil and A. Proskurowski: A generalization of line graphs: (X, Y)-intersection graphs. Journal of Graph Theory 21 (1996) 267–287.
2. R. Diestel: Graph Theory (2nd Edition). Springer Verlag, New York, 2000.
3. J. Edmonds: Matroids and the greedy algorithm. Mathematical Programming 1 (1971) 127–136.
4. U. Faigle: Matroids in combinatorial optimization. In: Combinatorial Geometries (N. White, ed.), Cambridge University Press, Cambridge, 1987, pp. 161–210.
5. S.P. Fekete, R.T. Firla and B. Spille: Characterizing matchings as the intersection of matroids. Preprint, December 2002, arXiv:math.CO/0212235.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Persistency and matroid intersection;Computational Management Science;2007-10-12