대한수학회보 (Bulletin of the Korean Mathematical Society)

  • 제37권1호
  • /
  • Pages.121-125
  • /
  • 2000
  • /
  • 1015-8634(pISSN)
  • /
  • 2234-3016(eISSN)
대한수학회 (Korean Mathematical Society)
권호 표지

MATCHINGS IN LINE GRAPHS

  • Nam, Yun-Sun (Mathematics Department, Ehwa Womans University)
  • 발행 : 2000.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we obtain an algorithm for finding a maximum matching in the line graph L(G) of a graph G. The complexity of our algorithm is O($$\mid$E$\mid$$), where is the edge set of G($$\mid$E$\mid$$ is equal to the number of vertices in L(G)).

키워드

참고문헌

  1. Indag. Math. v.35 The existence of 1-factors in line graphs, squares and total graphs G.Chartrand;A.D. Polimeni;M.J. Stewart
  2. Proc. 21st Annual IEEE Symposium on Foundations of Computer Science An O(√( lVl· lEl)) algorithm for finding a maximum matching in general graphs S. Micali;V. Vazirani