Learn More
We present a new approach for the construction of lower bounds for the inf-sup stability constants required in a posteriori error analysis of reduced basis approximations to affinely parametrized partial differential equations. We combine the " linearized " inf-sup statement of the natural–norm approach with the approximation procedure of the Successive(More)
—The vertex canonical labeling technique is one of the powerful methods in solving the graph isomorphism problem. However, some famous algorithms relied upon this technique are incomplete due to their non-zero probability of rejection. In this paper, we advance a new method of vertex canonical labeling and propose a complete graph isomorphism algorithm with(More)
  • 1