Sciweavers

4103 search results - page 2 / 821
» Some results on the Collatz problem
Sort
View
CPM
2008
Springer
170views Combinatorics» more  CPM 2008»
13 years 9 months ago
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler, Michael R. Fellows, Christian Komus...
JSAT
2008
122views more  JSAT 2008»
13 years 7 months ago
SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
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...
Sriyankar Acharyya
JSYML
2010
95views more  JSYML 2010»
13 years 2 months ago
Some natural decision problems in automatic graphs
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...
Dietrich Kuske, Markus Lohrey
AMC
2007
81views more  AMC 2007»
13 years 7 months ago
The Korteweg-de Vries-Kawahara equation in a bounded domain and some numerical results
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...
Juan Carlos Ceballos, Mauricio Sepúlveda, O...