1697 search results - page 101 / 340 » Social-Networks Connect Services |
157
click to vote
JCO
2010
15 years 4 months ago
2010
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
181
click to vote
JDA
2010
15 years 4 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
156
click to vote
IEAAIE
2010
Springer
15 years 4 months ago
2010
Springer
The ability for a user to accurately estimate the amount of trust to be placed in a peer user is gaining more and more attention in social network applications. Trust aggregation p...
184
click to vote
ICDE
2011
IEEE
14 years 10 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
200
click to vote
IUI
2011
ACM
14 years 9 months ago
2011
ACM
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...