서브메뉴
검색
Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model
Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model
Detailed Information
- 자료유형
- 기사
- ISSN
- 00189286
- 서명/저자
- Greedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model / Joo, C. ; Lin, X. ; Shroff, N.B.
- 형태사항
- pp. 2734
- 기타저자
- Joo, C.
- 기타저자
- Lin, X.
- 기타저자
- Shroff, N.B.
- 모체레코드
- 모체정보확인
- Control Number
- gtec:340223
MARC
008170927s2009 a a kor■022 ▼a00189286
■245 ▼aGreedy Maximal Matching: Performance Limits for Arbitrary Network Graphs Under the Node-Exclusive Interference Model▼dJoo, C.▼eLin, X.▼eShroff, N.B.
■300 ▼app. 2734
■7001 ▼aJoo, C.
■7001 ▼aLin, X.
■7001 ▼aShroff, N.B.
■773 ▼tIEEE transactions on Automatic Control▼gv.54 n.12▼d2009, 12
■SIS ▼aKS021652▼b63263▼h3▼sG
Preview
Export
ChatGPT Discussion
AI Recommended Related Books
detalle info
- Reserva
- Book Loan Request Service
- Mi carpeta
