In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information
Fulltekst
RELATERTE DOKUMENTER
Of 490 colonies screened, eight nirK-containing isolates were phylogenetically identified (16S rRNA genes) as members of the Rhizobiales. A nirK gene related to a large cluster
Based on this convergence result, a method for determining the radius of analyticity of solutions of the generalized KdV equation is derived.. Results from the new method and a
If the computed velocity u n exceeds the propagation speed U n , one is led to conclude from the convective breaking criterion (2.8) that around the time t n the wave is start- ing
In particular, we show that for all positive integers t and W , the Minimum Weight t -spanner problem admits a EPTAS on apex-minor-free graphs with positive integer weights of edges
In this paper, we study the pa- rameterized complexity of local search for the Minimum Fill-in problem in the following form: Given a triangulation H of a graph G, is there a
We show that for several classes of sparse graphs, including planar graphs, graphs of bounded vertex degree and graphs excluding some fixed graph as a minor, an improved solution in
In this paper we considered the Subgraph Isomorphism problem and the #Subgraph Isomorphism problem and gave the best known algorithms, in terms of time and space requirements, for
For this, it is necessary to go through the entire characterization of H -minor-free graphs given by Robertson and Seymour in their Graph Minors project (in particular, in [37])