Improved K-K algorithm for computing Lyapunov values
Wang, Duo, Mao, Rei
Similarity:
Wang, Duo, Mao, Rei
Similarity:
Lucja Sobich (1970)
Applicationes Mathematicae
Similarity:
Charles A. Stuart, Huan-Song Zhou (2001)
Annales de l'I.H.P. Analyse non linéaire
Similarity:
D. Benterki, B. Merikhi (2010)
RAIRO - Operations Research
Similarity:
In this note, we present a slight modification of an algorithm for the strict feasibility problem. This modification reduces the number of iterations.
M. Szyszkowicz (1984)
Applicationes Mathematicae
Similarity:
David Ruelle (1998)
Publications Mathématiques de l'IHÉS
Similarity:
Ngoc C. Lê, Christoph Brause, Ingo Schiermeyer (2015)
Discussiones Mathematicae Graph Theory
Similarity:
The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.
Anna Bartkowiak (1974)
Applicationes Mathematicae
Similarity:
F. Alouges, J. M. Ghidaglia (1997)
Annales de l'I.H.P. Physique théorique
Similarity: