Efficiently covering complex networks with cliques of similar vertices (Q2368963): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2005.12.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1968481794
@@ Property / OpenAlex ID: W1968481794 / rank @@
+Normal rank
@@ Property / cites work @@
+Component evolution in random intersection graphs
@@ Property / cites work: Component evolution in random intersection graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Two Models of Random Intersection Graphs and their Applications
+Normal rank
@@ Property / cites work @@
+Bipartite structure of all complex networks
@@ Property / cites work: Bipartite structure of all complex networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4519896
@@ Property / cites work: Q4519896 / rank @@
+Normal rank
@@ Property / cites work @@
+On Random Intersection Graphs: The Subgraph Problem
+Normal rank
@@ Property / cites work @@
+Random interval graphs
@@ Property / cites work: Random interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex degree distribution of random intersection graphs
+Normal rank
@@ Property / cites work @@
+Coloring Random Intersection Graphs and Complex Networks
+Normal rank