Coefficient of internal stability of graphs

  title={Coefficient of internal stability of graphs},
  author={A. D. Korshunov},
Algorithms for the Maximum Independent Set Problem
Strong Independent Saturation in Complementary Prisms
The strong independent saturation number I(G) of a graph G = (V,E) is defined as min {I(v) : v ∈ V }, where I(v) is the maximum cardinality of a minimal strong independent dominating set of G thatExpand
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computationalExpand