Cited By
View all- Burel GHe YStumme GHotho A(2013)A question of complexityProceedings of the 24th ACM Conference on Hypertext and Social Media10.1145/2481492.2481493(1-10)Online publication date: 1-May-2013
Abstract
No abstract available.
Recommendations
Efficient Community Search Based on Relaxed k-Truss Index
SIGIR '24: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information RetrievalCommunities are prevalent in large graphs such as social networks, protein networks, etc. Community search aims to find a cohesive subgraph that contains the query nodes. Existing community search algorithms often adopt community models to find target ...
Community Acknowledgment: Engaging Community Members in Volunteer Acknowledgment
GROUPVolunteers in non-profit groups are a valuable workforce that contributes to economic development and supports people in need in the U.S. However, many non-profit groups face challenges including engaging and sustaining volunteer participation, as well ...
Comparison between the zeroth-order Randić index and the sum-connectivity index
The zeroth-order Randić index and the sum-connectivity index are very popular topological indices in mathematical chemistry. These two indices are based on vertex degrees of graphs and attracted a lot of attention in recent years. Recently Li and Li (...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
April 2009
279 pages
Copyright © 2009 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 April 2009
Check for updates
Qualifiers
- Research-article
Conference
Persuasive 2009
Persuasive 2009: Persuasive 2009; 4th International Conference on Persuasive Technology
April 26 - 29, 2009
California, Claremont, USA
Acceptance Rates
Persuasive '09 Paper Acceptance Rate 21 of 66 submissions, 32%;
Overall Acceptance Rate 32 of 137 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 149Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Nov 2024
Other Metrics
Citations
Cited By
View all- Burel GHe YStumme GHotho A(2013)A question of complexityProceedings of the 24th ACM Conference on Hypertext and Social Media10.1145/2481492.2481493(1-10)Online publication date: 1-May-2013
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in