Refine
Year of publication
- 2016 (19) (remove)
Document Type
- Article (7)
- Conference Proceeding (6)
- Book (5)
- Part of a Book (1)
Has Fulltext
- no (19) (remove)
Keywords
- Additive Manufacturing (1)
- Assessment (1)
- Balanced hypergraph (1)
- Business Simulations (1)
- Collaborative robot (1)
- Duality (1)
- Eutectic Silver Copper alloy (1)
- Gamification (1)
- Hall’s Theorem (1)
- Human-Robot interaction (1)
- Hypergraph (1)
- Koenig’s Theorem (1)
- Matching (1)
- Path planning (1)
- Porositat (1)
- Response Surface Method (1)
- SLM (1)
- Safety concept (1)
- Serious Games (1)
- Vertex cover (1)
Institute
- Fachbereich Maschinenbau und Mechatronik (19) (remove)
We prove characterizations of the existence of perfect ƒ-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the ƒ-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems with purely combinatorial arguments, whereas for non-uniform balanced hypergraphs we show that the ƒ-factor problem is NP-hard.