An activity profile model and dynamic-matching results for social networks regarding wellness applications

ECTI-CON 2010 - The 2010 ECTI International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology

Volumn , Issue , 2010, Pages 656-660

  Greenlaw, Raymond ^a,b  

^a UNITED STATES NAVAL ACADEMY   (United States)

^b Elbrys Networks Inc   (United States)

Author keywords

Computers and information technology; Matching; Mobile wellness applications; Social networking

Indexed keywords

ACTIVITY PROFILE; DYNAMIC MATCHING; FACEBOOK; HEALTH-CARE SYSTEM; JOINT ACTIVITY; MATCHING PROBLEMS; NP COMPLETE; NP-HARD; OUT-OF-CONTROL; POLYNOMIAL-TIME ALGORITHMS; REAL TIME; SOCIAL NETWORKING; SOCIAL NETWORKS; TIME CONSTRAINTS; WELLNESS APPLICATIONS;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; INFORMATION TECHNOLOGY; INTERNET; SOCIAL NETWORKING (ONLINE);

WIRELESS NETWORKS;

EID: 77954892657     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. Ardigo, D. et al. Hyperinsulinemia predicts hepatic fat content in healthy individuals with normal transaminase concentrations, Metabolism, 54(12):2005.
2. Agnarsson, G. and Greenlaw, R. Graph Theory: Modeling, Applications, and Algorithms. Prentice Hall, 2007.
3. Cook, S. Personal communication, 1982.
4. Dahlhaus, E., Hajnal, P., and Karpinski, M. Optimal parallel algorithms for the Hamiltonian cycle problem on dense graphs. In 29th Annual IEEE Symposium on Foundations of Computer Science, 186{193, 1988.
5. Dobkin, D. and Ladner, R. Private communication cited in [11], 1978.
6. Edmonds, J. Maximum matchings and a polyhedron with 0, 1-vertices, Journal of Research of the National Bureau of Standards, 69B:125-130, 1965.
7. Connecting Wellness Communities. Elbrys Networks, Inc. www.elbrys.com, 2010.
8. Farin, H. M., Abbasi, F., and Reaven, G. M. Body mass index and waist circumference both contribute to differences in insulin-mediated glucose disposal in nondiabetic adults. American Journal of Clinical Nutrition, 83(1):47{51.
9. Gabow, H. N. An efficient implementation of Edmond's algorithm for maximum matchings on graphs, Journal of the Association for Computing Machinery, 23(2):221{234, 1976.
10. Gabow, H. N. Data structures for weighted matching and nearest common ancestors with linking, In Proceedings of the 1st Annual SIAM Symposium on Discrete Algorithms, 434{443, 1990.
11. Garey, M. R. and Johnson, D. S. Computers and In- tractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
12. Greenlaw, R., Hoover, H. J., and Ruzzo, W. L. Limits to Parallel Computation: P-Completeness Theory, Oxford University Press, 1995.
13. National Health Expenditure. CMS; Bureau of Economic Activity.
14. Itai, A. and Rodeh, M. Some matching problems. Automata, Languages, and Programming. Lecture Notes in Computer Science, volume 52, Springer, Berlin, 258{268, 1977.
15. Lawler, E. L. Combinatorial Optimization: Networks and Matroids. Holt, Rienhold, and Winston, 1976.
16. Lovász, L. and Plummer, M. D. Matching Theory, volume 121 of Annals of Discrete Mathematics, North Holland, 1986.
17. Karp, R. M. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher (editors), Complexity of Computer Computations, Plenum Press, New York, 85{103, 1972.
18. Karp, R. M., Upfal, E., and Wigderson, A. Constructing a perfect matching is in Random NC. Combinatorics, 6(1):35{48, 1986.
19. Mayr, E. W. and Subramanian, A. The complexity of circuit value and network stability, Journal of Computer and System Sciences, 44(2):302{323, 1992.
20. Micali, S. and Vazirani, V. V. An O(√ V · E) algorithm for finding a maximum matching in a general graph. In Proceedings of the 21st Annual IEEE Symposium on the Foundations of Computer Science, 17{27, 1980.
21. Mucha, M. and Sankowski, P. Maximum Matching via Gaussian Elimination. In Proceedings of the 45th IEEE Symposium on the Foundations of Computer Science, pages 248{255, 2004.
22. Mulmuley, K., Vazirani, U. V., and Vazirani, V. V. Matching is as easy as matrix inversion. Combinatorica, 7(10):105{113, 1987.
23. Piniewski, B. Technology-enabled health impact measures, presentation, 2009.
24. Power, M. L. and Schulkin, J. The Evolution of Obesity. Johns Hopkins University Press, 2009.
25. Reaven, G. All obese individuals are not created equal: insulin resistance is the major determinant of cardiovascular disease in overweight/obese individuals. Diabetes and Vascular Disease Research, 2(3):105{112, 2005.
26. Reaven, G., Abbasi, F., and McLaughlin, T. Obesity, insulin resistance, and cardiovascular disease. Recent Progress in Hormone Research, 59:207{223, 2004.
27. Uehara, R. and Chen, Z. Parallel approximation algorithms for maximum weighted matchings in general graphs, Information Processing Letters, 76(1):13{17, 2000.
28. 1/2|E|) general graph matching algorithm, Combinatorica 14:71{91, 1994.
29. Yannakakis, M. and Gavril, F. Edge dominating sets in graphs, unpublished manuscript, 1978.