We prove that maximum three dimensional matching is a MAX SNP-hard problem. If the number of occurrences of elements in triples is bounded by a constant the problem is MAX SNP-complete. As corollaries we prove that maximum covering by 3-sets and maximum covering of a graph by triangles are MAX SNP-hard. The problems are MAX SNP-complete if the number of occurrences of the elements and the degre...

Given a scrio of trinocular it~iirges of an object, wc: have cl~:velopcd a trrotlrod for Luildilrg 31) L.'accts arid 31) segn~cn t s nrodel of the object. Frorn each triplet, a partial rlescription of tlre object, called 3D View, is extracted. I+OIII the set of all extracted 3D Facets, a strategy for guiding the object reconstruction, based on a statistical ~ u e t l ~ o d is developed. A 3D Mn...

We propose a mesh comparison method using a new attribute deviation metric. The considered meshes contain geometrical and appearance attributes (material color, texture, temperature, etc.). The proposed deviation metric computes local differences between the attributes of two meshes. A mesh comparison assessment can be done easily and quickly using this metric. The techniques proposed are appli...

In this paper we show that the Inverse problems of HAMILTONIAN CYCLE and 3D-MATCHING are coNP complete. This completes the study of inverse problems of the six natural NP-complete problems from [GJ79] and answers an open question from [Ch03]. We classify the inverse complexity of the natural verifier for HAMILTONIAN CYCLE and 3D-MATCHING by showing coNP-completeness of the corresponding inverse...

Motivated by a conjecture of Liang [Y.-C. Liang. Anti-magic labeling of graphs. PhD thesis, National Sun Yat-sen University, 2013.], we introduce a restricted path packing problem in bipartite graphs that we call a V-free 2-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the ...

We investigate the representation of a symmetric group Sn on the homology of its Quillen complex at a prime p. For homology groups in small codimension, we derive an explicit formula for this representation in terms of the representations of symmetric groups on homology groups of p-uniform hypergraph matching complexes. We conjecture an explicit formula for the representation of Sn on the top h...

in the present work, multidimensional modeling of open-cycle process of om355 engine was developed. calculations for computational mesh were carried out. the results of the model were validated by experimentally measured in-cylinder pressure and the good agreement between calculations and measurements approved the trustworthy of numerical code. results included pressure, temperature, emission a...

background : glenoid bone damages consisting of anterior rim erosion and bony avulsion are very important in decision making for treatment of recurrent dislocation in shoulder joint. this study was aimed to determine the prevalence of these damages in patients with anterior recurrent shoulder dislocation. methods : the study was a cross-sectional study evaluating patients with unstable shoulder...