Pages that link to "Item:Q2437849"
From MaRDI portal
The following pages link to Information-sharing in social networks (Q2437849):
Displaying 17 items.
- Clustering on \(k\)-edge-colored graphs (Q335326) (← links)
- Staying safe and visible via message sharing in online social networks (Q405681) (← links)
- Club formation by rational sharing: Content, viability and community structure (Q943874) (← links)
- Privacy-conscious information diffusion in social networks (Q1664160) (← links)
- Non-existence of stable social groups in information-driven networks (Q2158297) (← links)
- Sharing information in web communities (Q2268111) (← links)
- How long does it take for all users in a social network to choose their communities? (Q2334040) (← links)
- Privacy-constrained network formation (Q2411529) (← links)
- The Parallel Complexity of Coloring Games (Q2819445) (← links)
- (Q2939557) (← links)
- A Relational View of Information Seeking and Learning in Social Networks (Q3114840) (← links)
- How long does it take for all users in a social network to choose their communities? (Q3305724) (← links)
- Loss of information in feedforward social networks (Q3388892) (← links)
- Improved Approximations for the Max k-Colored Clustering Problem (Q3453278) (← links)
- A 0.3622-Approximation Algorithm for the Maximum k-Edge-Colored Clustering Problem (Q4965094) (← links)
- Access and Sharing Contents Through the Social Network: A POMDP Approach (Q4973840) (← links)
- Precise dissemination of e-commerce information and behavior of social media users (Q6039011) (← links)
