Results 201 to 210 of about 818,578 (247)

Heterogeneity among <i>Mycobacterium avium</i> complex species isolated from pulmonary infection in Taiwan. [PDF]

Microbiol Spectr
Lin H-M, Shu C-C, Chen C-H, Chen N-Y, Yang J-H, Chen C-H, Li S-H, Wang C-L, Yu C-T, Lin S-M, Kao K-C, Huang C-C, Yang C-T, Lu J-J, Chiu C-H, Lai H-C, Wu T-S.   +16 more
europepmc   +1 more source

Temporal variation of leaf nutrient retranslocation in exotic and indigenous tree species in Zagros forests, Iran. [PDF]

Sci Rep
Karamian M, Mirzaei J, Heydari M, Kooch Y, Dey DCS.   +4 more
europepmc   +1 more source

Finding Edge-Disjoint Paths in Partial k -Trees

Algorithmica, 2000
For a given graph \(G\) and \(p\) pairs \((s_i,t_i)\), \(1\leq i\leq p\), of vertices of \(G\), the edge-disjoint paths problem is to find \(p\) pairwise edge-disjoint paths \(P_i\), \(1\leq i \leq p\), connecting \(s_i\) and \(t_i\). This paper gives two algorithms for the edge-disjoint paths problem on partial \(k\)-trees.
Xiao Zhou, Shunsuke Tamura, Takao Nishizeki   +2 more
  +5 more sources

Vertex partitioning problems on partial k-trees

, 1996
We describe a general approach to obtain polynomial-time algorithms over partial k-trees for graph problems in which the vertex set is to be partitioned in some way. We encode these problems with formulae of the Extended Monadic Second-order (or EMS) logic. Such a formula can be translated into a polynomial-time algorithm automatically. We focus on the
Arvind Gupta, Damon Kaller, Sanjeev Mahajan, Tom Shermer   +3 more
openalex   +4 more sources

Memory Requirements for Table Computations in Partial \sl k -Tree Algorithms

Algorithmica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bengt Aspvall, Jan Arne Telle, Andrzej Proskurowski   +2 more
openalex   +4 more sources

Algorithms for the Multicolorings of Partial k-Trees

, 2002
Let each vertex v of a graph G have a positive integer weight ?(v). Then a multicoloring of G is to assign each vertex v a set of ?(v) colors so that any pair of adjacent vertices receive disjoint sets of colors. A partial k-tree is a graph with tree-width bounded by a fixed constant k.
Takehiro Ito, Takao Nishizeki, Xiao Zhou
openalex   +2 more sources