메뉴 건너뛰기




Volumn , Issue , 2011, Pages 870-875

Beyond graphs: Capturing groups in networks

Author keywords

[No Author keywords available]

Indexed keywords

BETTI NUMBERS; COLLABORATION NETWORK; COLLABORATIVE TEAMS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMMUNICATIONS NETWORKS; DE FACTO; GROUP DYNAMICS; MODEL GROUPS; NETWORK SCIENCE; SIMPLICIAL COMPLEX; WIRELESS BROADCAST;

EID: 79960578170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOMW.2011.5928935     Document Type: Conference Paper
Times cited : (20)

References (24)
  • 3
    • 33646057364 scopus 로고    scopus 로고
    • Texture design using a simplicial complex of morphable textures
    • W. Matusik, M. Zwicker, and F. Durand, "Texture design using a simplicial complex of morphable textures," ACM Trans. Graph., vol. 24, no. 3, pp. 787-794, 2005.
    • (2005) ACM Trans. Graph. , vol.24 , Issue.3 , pp. 787-794
    • Matusik, W.1    Zwicker, M.2    Durand, F.3
  • 4
    • 77954729913 scopus 로고    scopus 로고
    • Distributed coverage verification in sensor networks without location information
    • Aug
    • A. Tahbaz-Salehi and A. Jadbabaie, "Distributed coverage verification in sensor networks without location information," IEEE Transactions on Automatic Control, vol. 55, pp. 1837-1849, Aug 2010.
    • (2010) IEEE Transactions on Automatic Control , vol.55 , pp. 1837-1849
    • Tahbaz-Salehi, A.1    Jadbabaie, A.2
  • 5
    • 33744946538 scopus 로고    scopus 로고
    • Coverage and hole-detection in sensor networks via homology
    • R. Ghrist and A. Muhammad, "Coverage and hole-detection in sensor networks via homology," in IPSN, pp. 254-260, 2005.
    • (2005) IPSN , pp. 254-260
    • Ghrist, R.1    Muhammad, A.2
  • 6
    • 57349158591 scopus 로고    scopus 로고
    • Using persistent homology to recover spatial information from encounter traces
    • B. D. Walker, "Using persistent homology to recover spatial information from encounter traces," in MobiHoc, pp. 371-380, 2008.
    • (2008) MobiHoc , pp. 371-380
    • Walker, B.D.1
  • 7
    • 0015328896 scopus 로고
    • From cohomology in physics to q-connectivity in social science
    • R. H. Atkin, "From cohomology in physics to q-connectivity in social science," Int. J. Man-Machine studies, vol. 4, pp. 139-167, 1972.
    • (1972) Int. J. Man-Machine Studies , vol.4 , pp. 139-167
    • Atkin, R.H.1
  • 8
    • 33751111026 scopus 로고
    • A structural analysis of a game: The liverpool v machester united cup final of 1977
    • P. Gould and A. Gatrell, "A structural analysis of a game: The liverpool v machester united cup final of 1977," Social Networks, vol. 2, pp. 255-273, 1979-1980.
    • (1979) Social Networks , vol.2 , pp. 255-273
    • Gould, P.1    Gatrell, A.2
  • 9
    • 84955771318 scopus 로고    scopus 로고
    • Q-analysis and the structure of friendship networks
    • L. C. Freeman, "Q-analysis and the structure of friendship networks," Int. J. Man Machine Studies, vol. 12, pp. 367-378.
    • Int. J. Man Machine Studies , vol.12 , pp. 367-378
    • Freeman, L.C.1
  • 11
    • 0003938947 scopus 로고    scopus 로고
    • Optimized link state routing
    • T. Clausen and P. Jacquet, "Optimized link state routing," in IETF RFC 3626, 2003.
    • (2003) IETF RFC , vol.3626
    • Clausen, T.1    Jacquet, P.2
  • 13
    • 50149093082 scopus 로고    scopus 로고
    • Minimizing broadcast latency and redundancy in ad hoc networks
    • R. Gandhi, A. Mishra, and S. Parthasarathy, "Minimizing broadcast latency and redundancy in ad hoc networks," IEEE/ACM Trans. Netw., vol. 16, no. 4, pp. 840-851, 2008.
    • (2008) IEEE/ACM Trans. Netw. , vol.16 , Issue.4 , pp. 840-851
    • Gandhi, R.1    Mishra, A.2    Parthasarathy, S.3
  • 14
    • 19644369843 scopus 로고    scopus 로고
    • Approximation algorithms for connected dominating sets
    • S. Guha and S. Khuller, "Approximation algorithms for connected dominating sets," Algorithmica, vol. 20, pp. 374-387, 1998.
    • (1998) Algorithmica , vol.20 , pp. 374-387
    • Guha, S.1    Khuller, S.2
  • 15
    • 34648860385 scopus 로고
    • Kneser's conjecture, chromatic number, and homotopy
    • L. Lovász, "Kneser's conjecture, chromatic number, and homotopy," J. Comb. Theory, Ser. A, vol. 25, no. 3, pp. 319-324, 1978.
    • (1978) J. Comb. Theory, Ser. A , vol.25 , Issue.3 , pp. 319-324
    • Lovász, L.1
  • 17
    • 0035895239 scopus 로고    scopus 로고
    • The structure of scientific collaboration networks
    • M. E. J. Newman, "The structure of scientific collaboration networks," Proc. National Academy of Sciences, vol. 98, no. 2, pp. 404-409, 2001.
    • (2001) Proc. National Academy of Sciences , vol.98 , Issue.2 , pp. 404-409
    • Newman, M.E.J.1
  • 20
    • 32144460154 scopus 로고    scopus 로고
    • Challenges: A radically new architecture for next generation mobile ad hoc networks
    • (Cologne, Germany), Aug.
    • R. Ramanathan, "Challenges: A radically new architecture for next generation mobile ad hoc networks," in Proc. of ACM MobiCom, (Cologne, Germany), Aug. 2005.
    • (2005) Proc. of ACM MobiCom
    • Ramanathan, R.1
  • 21
    • 0037445324 scopus 로고    scopus 로고
    • Collaborative in-network processing for target tracking
    • January
    • J. Liu, J. Reich, and F. Zhao, "Collaborative in-network processing for target tracking," EURASIP J. Appl. Signal Process., vol. 2003, pp. 378-391, January 2003.
    • (2003) EURASIP J. Appl. Signal Process. , vol.2003 , pp. 378-391
    • Liu, J.1    Reich, J.2    Zhao, F.3
  • 22
    • 19044395829 scopus 로고    scopus 로고
    • A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering
    • July
    • T. Y. Lin and I.-J. Chiang, "A simplicial complex, a hypergraph, structure in the latent semantic space of document clustering," Int. J. Approx. Reasoning, vol. 40, pp. 55-80, July 2005.
    • (2005) Int. J. Approx. Reasoning , vol.40 , pp. 55-80
    • Lin, T.Y.1    Chiang, I.-J.2
  • 23
    • 0002529940 scopus 로고    scopus 로고
    • Polymake: A framework for analyzing convex polytopes
    • G. Kalai and G. M. Ziegler, eds., Birkhäuser
    • E. Gawrilow and M. Joswig, "polymake: a framework for analyzing convex polytopes," in Polytopes - Combinatorics and Computation (G. Kalai and G. M. Ziegler, eds.), pp. 43-74, Birkhäuser, 2000.
    • (2000) Polytopes - Combinatorics and Computation , pp. 43-74
    • Gawrilow, E.1    Joswig, M.2


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