Large-scale clique cover of real-world networks (Q2288213): Difference between revisions

@@ Property / cites work @@
+Algorithms for compact letter displays: comparison and evaluation
+Normal rank
@@ Property / cites work @@
+Efficiently covering complex networks with cliques of similar vertices
+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 @@
+Can visibility graphs be represented compactly?
@@ Property / cites work: Can visibility graphs be represented compactly? / rank @@
+Normal rank
@@ Property / cites work @@
+Finding all maximal cliques in dynamic graphs
@@ Property / cites work: Finding all maximal cliques in dynamic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical analysis of financial networks
@@ Property / cites work: Statistical analysis of financial networks / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing an indeterminate string from its associated graph
+Normal rank
@@ Property / cites work @@
+Covering edges by cliques with regard to keyword conflicts and intersection graphs
+Normal rank
@@ Property / cites work @@
+Q4138414
@@ Property / cites work: Q4138414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Known Algorithms for Edge Clique Cover are Probably Optimal
+Normal rank
@@ Property / cites work @@
+Q4152571
@@ Property / cites work: Q4152571 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448745
@@ Property / cites work: Q4448745 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4016827
@@ Property / cites work: Q4016827 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms on circular-arc graphs
@@ Property / cites work: Linear time algorithms on circular-arc graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4014438
@@ Property / cites work: Q4014438 / rank @@
+Normal rank
@@ Property / cites work @@
+Data reduction and exact algorithms for clique cover
+Normal rank
@@ Property / cites work @@
+On the hardness of approximating minimization problems
+Normal rank
@@ Property / cites work @@
+Q4945528
@@ Property / cites work: Q4945528 / rank @@
+Normal rank
@@ Property / cites work @@
+The Enumeration of Maximal Cliques of Large Graphs
+Normal rank
@@ Property / cites work @@
+Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
+Normal rank
@@ Property / cites work @@
+The Representation of a Graph by Set Intersections
+Normal rank
@@ Property / cites work @@
+Assignment-minimum clique coverings
@@ Property / cites work: Assignment-minimum clique coverings / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+The worst-case time complexity for generating all maximal cliques and computational experiments
+Normal rank
@@ Property / cites work @@
+Q4598291
@@ Property / cites work: Q4598291 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3291948
@@ Property / cites work: Q3291948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2896064
@@ Property / cites work: Q2896064 / rank @@
+Normal rank