The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning block...
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
We are concerned with the initial-boundary problem associated to the Korteweg–de Vries–Kawahara perturbed by a dispersive term which appears in several fluids dynamics proble...