SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Algorithms

Volumn 2, Issue 4, 1981, Pages 328-336

A weighted matroid intersection algorithm

(1) Frank, András a

a Res Inst for Telecommunications (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000484665 PISSN: 01966774 EISSN: None Source Type: Journal
DOI: 10.1016/0196-6774(81)90032-8 Document Type: Article

Times cited : (126)

References (11)

1
- 84915081847
- Optimum Branching Systems
- 2nd ed., University of Waterloo
- (1978) Ph.D. thesis
- Calvillo¹

2
- 27744567233
- Matroids and the greedy algorithm
- (1970) Math. Programming , vol.1
- Edmonds¹

3
- 0002167079
- Submodular functions, matroids and certain polyhedra
- 2nd ed., R Guy, H Hanani, N Sauer, F Schönheim, Proceedings, International Conference, Calgary Alberta, Canada
- (1969) Combinatorial Structures and Their Applications
- Edmonds¹

4
- 0002758061
- Matroid intersection
- 2nd ed., Annals of Discrete Mathematics, North-Holland, Amsterdam
- (1979) Discrete Optimization , vol.4
- Edmonds¹

5
- 84915081845
- H. Gröflin and A. J. Hoffman, On matroid intersection, Combinatorica [a new Hungarian quarterly], in press.

6
- 0009189848
- An algorithm for finding an optimal independent assignment set
- (1976) J. Operations Res. Soc. Japan , vol.19 , pp. 32-57
- Iri¹ Tomizava²

7
- 35248838529
- A combinatorial proof of Lawler's matroid intersection algorithm
- unpublished manuscript
- (1975) A combinatorial proof of Lawler's matroid intersection algorithm
- Krogdahl¹

8
- 0016536930
- Matroid intersection algorithm
- (1975) Math. Programming , vol.9 , pp. 31-56
- Lawler¹

9
- 0003558735
- Holt Rinehart Winston, New York
- (1976) Combinatorial Optimization: Networks and Matroids
- Lawler¹

10
- 84915081844
- M. Chung-fan, L. Chen-hung, and L. Mao-cheng, Optimum restricted base of a matroid, to appear.

11
- 0004045430
- Academic Press, London/New York
- (1976) Matroid Theory
- Welsh¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.