The NP-Completeness of Some Edge-Partition Problems

1981 ◽  
Vol 10 (4) ◽  
pp. 713-717 ◽  
Author(s):  
Ian Holyer
Keyword(s):  
Np Completeness ◽  
Edge Partition

scholarly journals NP-completeness and degree restricted spanning trees

1992 ◽  
Vol 105 (1-3) ◽  
pp. 41-47 ◽  
Author(s):  
Robert James Douglas
Keyword(s):  
Spanning Trees ◽  
Np Completeness

ON THE COMPLEXITY OF SCHEDULING WITH COMMUNICATION DELAY AND CONTENTION

1995 ◽  
Vol 05 (03) ◽  
pp. 331-341 ◽  
Author(s):  
MICHAEL G. NORMAN ◽  
SUSANNA PELAGATTI ◽  
PETER THANISCH
Keyword(s):  
Execution Time ◽  
Communication Delay ◽  
Interprocessor Communication ◽  
Communication Latency ◽  
Processor Scheduling ◽  
Np Completeness

We show the NP-Completeness of two processor scheduling with tasks of execution time 1 or 2 units and unit interprocessor communication latency. We develop a model of scheduling in the presence of communication contention, and show the NP-Completeness of two processor scheduling with unit execution time tasks in our model.

scholarly journals Max NP-completeness made easy

1999 ◽  
Vol 225 (1-2) ◽  
pp. 65-79 ◽  
Author(s):  
Pierluigi Crescenzi ◽  
Luca Trevisan
Keyword(s):  
Np Completeness

Decomposing Complete 3-Uniform Hypergraph into 5-Cycles

2014 ◽  
Vol 672-674 ◽  
pp. 1935-1939
Author(s):  
Guan Ru Li ◽  
Yi Ming Lei ◽  
Jirimutu
Keyword(s):  
Positive Integer ◽  
Hamiltonian Cycles ◽  
Uniform Hypergraph ◽  
Design Algorithm ◽  
Uniform Hypergraphs ◽  
Edge Partition ◽  
Definition Of

About the Katona-Kierstead definition of a Hamiltonian cycles in a uniform hypergraph, a decomposition of complete k-uniform hypergraph Kn(k) into Hamiltonian cycles studied by Bailey-Stevens and Meszka-Rosa. For n≡2,4,5 (mod 6), we design algorithm for decomposing the complete 3-uniform hypergraphs into Hamiltonian cycles by using the method of edge-partition. A decomposition of Kn(3) into 5-cycles has been presented for all admissible n≤17, and for all n=4m +1, m is a positive integer. In general, the existence of a decomposition into 5-cycles remains open. In this paper, we use the method of edge-partition and cycle sequence proposed by Jirimutu and Wang. We find a decomposition of K20(3) into 5-cycles.

Sign in / Sign up

Export Citation Format

Share Document