Graph-theoretic problems of identifying maximum cliques and maximum independent sets occupy a central place in combinatorial optimisation and theoretical computer science. A clique is a set of ...

Identifying the most influential spreaders as an influence maximization problem (IMP) has become one of the most compelling topics in social network analysis due to its successes in viral marketing.

(a) Performance of two adiabatic paths for finding the maximum independent set. (b) Performance of traditional heuristic adiabatic paths for finding independent sets. Quantum annealing, as a prominent ...