StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
12700738
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
1
CommunityOwnedDate
CreationDate
2012-10-03T01:24:01.277
FavoriteCount
0
LastActivityDate
2012-10-03T01:24:01.277
LastEditDate
LastEditorUserId
0
OwnerUserId
997989
ParentId
10285739
PostTypeId
2
Score
1
ViewCount
0
LastEditorDisplayName
text
Body
You can use the <a href="http://snap.stanford.edu/" rel="nofollow">SNAP network analysis library</a>, which implements the Tomita et al. 2006 algorithm. All other theoretically-fast algorithms have been shown to be significantly slower than Tomita et al. in practice, for sparse graphs at least (Eppstein et al. 2010). If that algorithm requires too much memory for a large graph, you can try the linear-space algorithm of Eppstein et al. 2010/2011. <ul> <li>Tomita, E.; Tanaka, A. & Takahashi, H. The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science, 2006, 363, 28 - 42. <a href="http://dx.doi.org/10.1016/j.tcs.2006.06.015" rel="nofollow">DOI:10.1016/j.tcs.2006.06.015</a></li> <li>Eppstein, D.; Löffler, M. & Strash, D. Cheong, O. Listing all maximal cliques in sparse graphs in near-optimal time. ISAAC '10: Proc. 21st International Symposium on Algorithms and Computation, Springer Berlin / Heidelberg, 2010, 6506, 403-414. <a href="http://dx.doi.org/10.1007/978-3-642-17517-6_36" rel="nofollow">DOI:10.1007/978-3-642-17517-6_36</a></li> <li>Eppstein, D. & Strash, D. Listing all maximal cliques in large sparse real-world graphs. SEA '11: Proc. 10th International Symposium on Experimental Algorithms, Springer Berlin / Heidelberg, 2011, 6630, 364-375. <a href="http://dx.doi.org/10.1007/978-3-642-20662-7_31" rel="nofollow">DOI:10.1007/978-3-642-20662-7_31</a></li> </ul>
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POClique enumeration in medium sized graph
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. This table or related slice is empty.
UserOwnerUserId
1. USedallme
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POClique enumeration in medium sized graph
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. This table or related slice is empty.
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.