[PDF] Top 20 THE PATH-PARTITION PROBLEM IN BLOCK GRAPHS

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

... revised, the example above is then not a counterexample. Second, the method in [1], although correct, is much more ...how the algorithm can be implemented in linear ... See full document

... On the other hand, the path-partition problem is polynomially solvable for trees [11,16], interval graphs [1,2,7], circular-arc graphs [2,7], cographs [5,6,13], ... See full document

... 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), is the minimum number of isometric paths ... See full document

... after the earthquake. The near –fault surface deformation is mainly characterized by anticlinal folding in the hanging wall and minor gentle synclinal folding in the ...footwall. ... See full document

... is in fact the exact value if r + 1 is a power of 2, for the case when n 1 = n 2 = · · · = n r = ...solve the isometric path problem on block ...graphs. In ... See full document

... D in graph G is called a geodetic set if all vertices of G are lying on some shortest u − v path of G, where u, v ∈ ...D. The geodetic number of a graph G is the minimum cardinality among all ... See full document

... Besides, it is also interesting to study the maximum connected interval subgraph problem on other special graphs such as permutation graphs and chordal graphs or even the split graphs.. [r] ... See full document

... for the constrained Hamiltonian path problems on distance-hereditary graphs ...distance-hereditary graphs can be solved in O(n 3 ) ...Hamiltonian path problems on ... See full document

... with the set of added edges marked by dashed lines. In this paper, we focus on augmenting graphs with a partition ...Here the partition constraint is that the vertex set ... See full document

... elements in the k parts of K such that the resulting k-subpartition has property ...All the partition properties we study are hereditary: if a partition π has property Q, then ... See full document

... general, the used techniques and the algorithmic results of this paper may have great help for implementing the Weighted Fair Queuing (WFQ) on real ...networks. The major goal of the ... See full document

... . In addition, P ( n , 3 ) is 4-ordered Hamiltonian if and only if n is even and either n = 18 or n ≥ ...results The induction step given in the proof of Theorem ...Hamiltonian path ... See full document

... 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

... of the current paper is to study the mean-partition ...is the observation that the single-shape mean-partition prob- lem can be reduced to a corresponding sum-partition ... See full document

... Our algorithm also requires the following augmenting trail operations: (1) X-augmenting trail detecting; (2) backtracking; (3) finding appropriate X-alternating trails[r] ... See full document

... Received by the editors June 30, 1989; accepted for publication (in revised form) March 6, 1990. Redistribution subject to SIAM license or copyright; see http://www.siam.org/journals/ojs[r] ... See full document

... Using the trivial approach, the quickest path problem can be solved in four main stages: constructing a spanning tree of N, broadcasting all topological information [r] ... See full document

... In [2], Harbane and Pa& constructed 3-spanners of the complete generalized p-cycle graphs, which represent a family of underlying graphs produced by the conjunction of [r] ... See full document

... We also study the guard problem in spiral polygons by connecting the class of nontrivial connected proper interval graphs with the class of stick-intersection graphs of s[r] ... See full document