A sufficient condition for a planar graph to be class 1.

Weifan Wang Yongzhu Chen

Published in: Theor. Comput. Sci. (2007)

Keyphrases

sufficient conditions
planar graphs
linear complementarity problem
lyapunov function
linear matrix inequality
exponential stability
efficiently computable
high dimensional
multi class
semidefinite programming
uniform convergence