[PDF] Top 20 Induced-path partition on graphs with special blocks

... Moreover, ten factors are input into binary logistic regression to build up land use distribution models for 1990, 1998, and 2001 and land use change models for 1990–1998 and 1998–2001[r] ... See full document

... The path-partition problem is to find a minimum number of vertex-disjoint paths that cover all vertices of a given ...the path-partition problem from an algorithmic point of ...Hamiltonian ... See full document

... Graph partition is an important problem in computer ...vertex partition, and many variants of the problem have been defined and investigated with different objectives and con- ...problems on ... See full document

... Pandu Rangan, Linear algorithm for optimal path cover problem on interval graphs, Inform.. Bonuccelli and D.P.[r] ... See full document

... of G 1 , G 2 , . . . , G t −1 . With this typo revised, the example above is then not a counterexample. Second, the method in [1], although correct, is much more complicated. Many involved concepts and cases are ... See full document

... Hamiltonian path problems on distance-hereditary ...problems on distance-hereditary graphs, we state some relevant properties of cographs ... See full document

... The game is played by two players, the cop and the robber, on a graph. The two players move alternately, starting with the cop. Each player’s first move consists of choosing a vertex at which to start. At ... See full document

... isometric path numbers of all com- plete r-partite graphs and Cartesian products of 2 or 3 complete ...complete graphs, which is the graph K n 1 K n 2  . . . K n r with vertex ... See full document

... weighted visibility graph of a polygon is a visibility graph of this polygon and the weight of an edge of this graph is the Euclidian distance between the ass[r] ... See full document

... Received 4 November 2003 Communicated by A.A. Bertossi Abstract An isometric path between two vertices in a graph G is a shortest path joining them. The isometric-path number of G, denoted by ip(G), ... See full document

... depending on the ...consistent with the fact that the mechanical coupling of the fault at shallow depth is higher during drier periods, inferred from the previous seasonal creep ... See full document

... By the aid of this theorem, sequential and parallel algorithms to determine if a given permutation graph is a cograph can be derived.. The rest of this paper i[r] ... See full document

... based on its deep learn- ing on revision ...revision graphs and capturing the details of past fixes as much as possible, and (2) discovering relations inside our revision graphs to expand the ... See full document

... them on the heat transfer behavior are to- tally ...the blocks indicates a much higher heat transfer from the blocks for turbulent convection cases than for lami- nar ... See full document

... Each application of Step 3 in Algorithm 2.1 will produce at least one more one in the uncrossed entries in the matrix and leave all the ones unchanged, unless they are crossed by [r] ... See full document

... when path diversity is combined with the error control scheme such as forward error ...scheme with path interleaving is proposed for improving the quality of video ...FEC blocks and ... See full document

... 發現報告，臨床現象及原住民之生吃習慣也予以討論。 Abstract According to the results obtained by our laboratory and the Department of Parasitology, Taipei Medical College, from 1995 to 1998, the overall infection rate of enterobiasis was 16% ... See full document

... Results show that the properties and locations of partition and Rayleigh number have a significant influence on the flow and heat transfer characteristics.[r] ... See full document

... v with d G (u) + d G (v)n(G) + k then G is (k + 2) ∗ -connected if and only if G + uv is (k + 2) ∗ ...v with d G (u) + d G (v)n(G) + k, then G is i ∗ -connected if and only if G + uv is i ∗ -connected for ... See full document

... regular graphs using the 2 ν× 2 ν symplectic group modulo p n , where p is a prime and n and ν are positive ...symplectic graphs of a symplectic space V over a commutative ring R and show that it is vertex ... See full document