On independent sets in random graphs (Q3452727): Difference between revisions

← Older edit

@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6783383
@@ Property / zbMATH Open document ID @@
+.05139
@@ Property / zbMATH Open document ID: 1376.05139 / rank @@
+Normal rank
@@ Property / publication date @@
+September 2017Timestamp +2017-09-29T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2017-09-29T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 29 September 2017 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+http://dl.acm.org/citation.cfm?id=2133048
+Normal rank
@@ Property / zbMATH DE Number @@
+6783383
@@ Property / zbMATH DE Number: 6783383 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2042503074
@@ Property / OpenAlex ID: W2042503074 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.1378
@@ Property / arXiv ID: 1007.1378 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4705344
@@ Property / cites work: Q4705344 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Large Independent Sets in Polynomial Expected Time
+Normal rank
@@ Property / cites work @@
+Cliques in random graphs
@@ Property / cites work: Cliques in random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Better Algorithm for Random <i>k</i>-SAT
@@ Property / cites work: A Better Algorithm for Random <i>k</i>-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+The solution of some random NP-hard problems in polynomial expected time
+Normal rank
@@ Property / cites work @@
+On Counting Independent Sets in Sparse Graphs
@@ Property / cites work: On Counting Independent Sets in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on the theory of graphs
@@ Property / cites work: Some remarks on the theory of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and certifying a large hidden clique in a semirandom graph
+Normal rank
@@ Property / cites work @@
+On the independence number of random graphs
@@ Property / cites work: On the independence number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3122905
@@ Property / cites work: Q3122905 / rank @@
+Normal rank
@@ Property / cites work @@
+Analysis of Two Simple Heuristics on a Random Instance ofk-sat
+Normal rank
@@ Property / cites work @@
+Application of statistical mechanics to NP-complete problems in combinatorial optimisation
+Normal rank
@@ Property / cites work @@
+Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
+Normal rank
@@ Property / cites work @@
+Phase transitions for the cavity approach to the clique problem on random graphs
+Normal rank
@@ Property / cites work @@
+On colouring random graphs
@@ Property / cites work: On colouring random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Large Cliques Elude the Metropolis Process
@@ Property / cites work: Large Cliques Elude the Metropolis Process / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Gibbs states and the set of solutions of random constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Graphs with small chromatic numbers are easy to color
+Normal rank
@@ Property / cites work @@
+Information, Physics, and Computation
@@ Property / cites work: Information, Physics, and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction and Clustering in Random Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Concentration of measure and isoperimetric inequalities in product spaces
+Normal rank
@@ Property / cites work @@
+Almost all k-colorable graphs are easy to color
@@ Property / cites work: Almost all k-colorable graphs are easy to color / rank @@
+Normal rank
@@ Property / cites work @@
+Backtrack: An O(1) expected time algorithm for the graph coloring problem
+Normal rank