Advanced Computer Architecture: Parallelism,Scalability,Programmability
Advanced Computer Architecture: Parallelism,Scalability,Programmability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
PaCT '97 Proceedings of the 4th International Conference on Parallel Computing Technologies
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
Combining Parallel and Sequential Workloads
Combining Parallel and Sequential Workloads
Matching Theory (North-Holland mathematics studies)
Matching Theory (North-Holland mathematics studies)
On-line arbitrarily vertex decomposable trees
Discrete Applied Mathematics
Decomposing trees with large diameter
Theoretical Computer Science
On minimal arbitrarily partitionable graphs
Information Processing Letters
Fully decomposable split graphs
European Journal of Combinatorics
Note: Partitioning powers of traceable or hamiltonian graphs
Theoretical Computer Science
| Hi-index | 0.05 |
In this article, we deal with graphs modelling interconnection networks of parallel systems (parallel computers, networks of workstations, etc.). We want to share the nodes of such a network between many users, each one needing a given number of nodes. Thus, a graph G with N vertices is said to be decomposable if for each set {n1,..., nk} whose sum is equal to N, there exists a partition V1,...,Vk of V(G) such that for each i, 1 ≤i≤k, |Vi| = ni and the subgraph induced by Vi is connected. We show that determining whether a given tripode (three disjoint chains connected by one extremity to a same new vertex) is decomposable can be done by a polynomial algorithm.