[PDF] Top 20 Path partition for graphs with special blocks
Has 10000 "Path partition for graphs with special blocks" found on our website. Below are the top 20 most common "Path partition for graphs with special blocks".
Path partition for graphs with special blocks
... 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
8
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
29
Corrigendum for `The path-partition problem in block graphs
... 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
1
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
6
Isometric path numbers of graphs
... 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 each ... See full document
6
Isometric path numbers of graphs
... 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
9
SPECIAL SUBGRAPHS OF WEIGHTED VISIBILITY GRAPHS
... 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
7
Isometric-path numbers of block graphs
... isometric path between two vertices in a graph G is a shortest path joining ...block graphs. We also give a linear-time algorithm for finding the corresponding ... See full document
4
Isometric-path numbers of block graphs
... cm for both the horizontal shortening and the vertical offset occurred as postseismic creep during the 120 –125 days following the main ...consistent with the fact that the mechanical coupling of the fault ... See full document
21
Hamiltonian Path Problems on Distance-Hereditary Graphs
... algorithms for the constrained Hamiltonian path problems on distance-hereditary ...algorithms for the constrained Hamiltonian problems on distance-hereditary graphs, we state some relevant ... See full document
19
Multi-path Forward Error Correction Control Scheme with Path Interleaving
... 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 ... See full document
5
Natural Convection in an Enclosure with Vertical Partition
... 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
1
Motion planning for multiple robots with multi-mode operations via disjunctive graphs
... planning for multiple robots with multi-mode operations is ...demonstrated with various robot operation requirements, including "non-priority", "with-priority", ... See full document
1
Motion planning for multiple robots with multi-mode operations via disjunctive graphs
... 日期: 1991 上傳時間: 2009-11-17T11:12:56Z 出版者: Asia University 摘要: A new approach to motion planning for multiple robots with multi-mode operations is proposed. Although sharing a common workspace, the robots are ... See full document
1
Motion planning for multiple robots with multi-mode operations via disjunctive graphs
... 上傳時間: 2009-11-25T02:30:58Z 出版者: Asia University 摘要: A new approach to motion planning for multiple robots with multi-mode operations is proposed. Although sharing a common workspace, the robots are assumed ... See full document
1
HKUST Hosts Underwater Robot Competition for Junior Students and Students with Special Education Needs
... Center for Global and Community Engagement, which co-organized the competition with School of Engineering, School of Business and Management, School of Science, School of Humanities and Social Science and ... See full document
1
Bridge-connectivity Augmenting Problem with a Partition Constraint
... graph with three partitions of ...(a) with the set of added edges marked by dashed ...augmenting graphs with a partition constraint. Here the partition constraint is that the ... See full document
6
Partition-optimization with Schur convex sum objective functions
... sufficient for optimality of consecutive partitions, generalizing many earlier ...allow for explicit solution of such problems without the need to scan through all consecutive ...associated with an ... See full document
13
Exploring aggregate effect with weighted transcoding graphs for efficient cache replacement in transcoding proxies
... algorithms for the transcoding proxy which typically interconnects two het- erogeneous ...established with the WAP ...object for future ...deal with in this ...is for general ... See full document
10
On Group Partition for Wireless Multicast Flow Control
... Group Partition for Wireless Multicast Flow Control Rung-Hung Gau, Member, IEEE Abstract—In this paper, we propose partitioning group mem- bers into subgroups according to their instantaneous channel gains ... See full document
4
相關主題