Enumerating maximal cliques in link streams with durations (Q1705705): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2018.01.006
@@ Property / DOI: 10.1016/j.ipl.2018.01.006 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Algorithm 457
@@ Property / describes a project that uses: Algorithm 457 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2963281929
@@ Property / OpenAlex ID: W2963281929 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06970
@@ Property / arXiv ID: 1712.06970 / rank @@
+Normal rank
@@ Property / cites work @@
+An Analysis of Some Graph Theoretical Cluster Techniques
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Large Sparse Real-World Graphs
+Normal rank
@@ Property / cites work @@
+What's in a crowd? Analysis of face-to-face behavioral networks
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+Enumerating maximal cliques in link streams with durations
+Normal rank
@@ Property / cites work @@
+Computing maximal cliques in link streams
@@ Property / cites work: Computing maximal cliques in link streams / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2018.01.006
@@ Property / DOI: 10.1016/J.IPL.2018.01.006 / rank @@
+Normal rank