메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 365-369

Approximating maximal cliques in ad-hoc networks

Author keywords

Ad hoc networks; Cliques; QoS capacity; Unit disk graph

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; QUALITY OF SERVICE; RESOURCE ALLOCATION;

EID: 11244281938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (37)

References (12)
  • 1
    • 0001388944 scopus 로고    scopus 로고
    • On coloring unit disk graphs
    • A. Graf, M. Stumpf, and G. Weisenfels, "On Coloring Unit Disk Graphs," Algorithmica, vol. 20, no. 3, pp. 277-293, 1998.
    • (1998) Algorithmica , vol.20 , Issue.3 , pp. 277-293
    • Graf, A.1    Stumpf, M.2    Weisenfels, G.3
  • 2
    • 0034539299 scopus 로고    scopus 로고
    • A new model for packet scheduling in multihop wireless networks
    • H. Luo, S. Lu, and V. Bhargavan, "A New Model for Packet Scheduling in Multihop Wireless Networks," Proc. ACM Mobicom, 2000, pp. 76-86.
    • (2000) Proc. ACM Mobicom , pp. 76-86
    • Luo, H.1    Lu, S.2    Bhargavan, V.3
  • 3
    • 69949176537 scopus 로고    scopus 로고
    • Optimizing traffic flow in fixed wireless networks
    • A. Pun, "Optimizing Traffic Flow in Fixed Wireless Networks", Proc. WCNC 2002.
    • Proc. WCNC 2002
    • Pun, A.1
  • 4
    • 1542299160 scopus 로고    scopus 로고
    • Impact of interference on multi-hop wireless network performance
    • San Diego, CA, USA, September
    • K. Jain, J. Padhye, V. N. Padmanabhan, and L. Qiu, "Impact of Interference on Multi-hop Wireless Network Performance," ACM Mobicom 2003, San Diego, CA, USA, September 2003.
    • (2003) ACM Mobicom 2003
    • Jain, K.1    Padhye, J.2    Padmanabhan, V.N.3    Qiu, L.4
  • 5
    • 18844390626 scopus 로고    scopus 로고
    • Price-based resource allocation in wireless ad-hoc networks
    • Monterey, California, June
    • Y. Xue, B. Li, and K. Nahrstedt, "Price-based Resource Allocation in Wireless Ad-Hoc Networks," in Proc. IWQoS 2003, Monterey, California, June 2003.
    • (2003) Proc. IWQoS 2003
    • Xue, Y.1    Li, B.2    Nahrstedt, K.3
  • 6
    • 85050416152 scopus 로고
    • A procedure for clique detection using the group matrix
    • F. Harary, and I. C. Ross, "A Procedure for Clique Detection Using the Group Matrix," Sociometry, vol. 20, pp. 205-215, 1957.
    • (1957) Sociometry , vol.20 , pp. 205-215
    • Harary, F.1    Ross, I.C.2
  • 8
    • 0014856267 scopus 로고
    • An analysis of some graph theoretical cluster techniques
    • October
    • J. G. Augustson, and J. Minker, "An Analysis of Some Graph Theoretical Cluster Techniques," Journal of the ACM (JACM), vol. 17, no. 4, pp. 571-588, October 1970.
    • (1970) Journal of the ACM (JACM) , vol.17 , Issue.4 , pp. 571-588
    • Augustson, J.G.1    Minker, J.2
  • 9
    • 84976668743 scopus 로고
    • Finding all cliques in an undirected graph
    • C. Bron and J. Kerbosch, "Finding All Cliques in an Undirected Graph," Communications of the ACM, vol. 16, pp. 575-577, 1973.
    • (1973) Communications of the ACM , vol.16 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2
  • 10


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