SCOPUS 정보 검색 플랫폼

Volumn 81, Issue 1, 2002, Pages 7-11

On maximum induced matchings in bipartite graphs

Author keywords

Bipartite graphs; Computational complexity; Graph algorithms; Maximum induced matching

Indexed keywords

MATHEMATICAL MODELS; POLYNOMIAL APPROXIMATION; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPHS; MAXIMUM INDUCED MATCHINGS;

GRAPH THEORY;

EID: 0037116454 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(01)00185-5 Document Type: Article

Times cited : (92)

References (7)

1
- 38249026369
- Induced matchings
- (1989) Discrete Appl. Math. , vol.24 , pp. 97-102
- Cameron, K.¹

2
- 0002493180
- Strong matchings on trees
- (1992) Congr. Numer. , vol.89 , pp. 239-243
- Fricke, G.¹ Laskar, R.²

3
- 0002482486
- Bi-complement reducible graphs
- (1997) Adv. Appl. Math. , vol.18 , pp. 389-402
- Giakoumakis, V.¹ Vanherpe, J.-M.²

4
- 38249000134
- Irredundancy in circular arc graphs
- (1993) Discrete Appl. Math. , vol.44 , pp. 79-89
- Golumbic, M.C.¹ Laskar, R.C.²

5
- 0000369268
- New results on induced matchings
- (2000) Discrete Appl. Math. , vol.101 , pp. 157-165
- Golumbic, M.C.¹ Lewenstein, M.²

6
- 4243144453
- Adding an identity to a totally unimodular matrix
- LSE. 94.14
- LSE Operations Research Working Paper , pp. 1994
- Ko, C.W.¹ Shepherd, F.B.²

7
- 23044518575
- On a generalization of bi-complement reducible graphs
- (2000) Lecture Notes in Comput. Sci. , vol.1893 , pp. 528-538
- Lozin, V.V.¹

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