Refine
Year of publication
- 2016 (26) (remove)
Institute
- Fachbereich Maschinenbau und Mechatronik (26) (remove)
Document Type
- Article (11)
- Conference Proceeding (9)
- Book (5)
- Part of a Book (1)
Keywords
- Additive Manufacturing (1)
- Assessment (1)
- Balanced hypergraph (1)
- Business Simulations (1)
- Collaborative robot (1)
- Designpraxis (1)
- Duality (1)
- Einbetten in das Internet der Dinge (1)
- Eutectic Silver Copper alloy (1)
- Gamification (1)
- Hall’s Theorem (1)
- Human-Robot interaction (1)
- Hypergraph (1)
- Koenig’s Theorem (1)
- Matching (1)
- Minimal-Ansatz für Embedded-Systeme (1)
- Path planning (1)
- Porositat (1)
- Response Surface Method (1)
- SLM (1)
- Safety concept (1)
- Serious Games (1)
- Vertex cover (1)
- Workspace monitoring (1)
Is part of the Bibliography
- no (26)
We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig’s Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32–40, 1970; Fulkerson et al. in Math Progr Study 1:120–132, 1974) and Hall’s Theorem (Conforti et al. in Combinatorica 16:325–329, 1996) for balanced hypergraphs.
There are different types of games that try to make use of the motivation of a gaming situation in learning contexts. This paper introduces the new terminology ‘Competence Developing Game’ (CDG) as an umbrella term for all games with this intention. Based on this new terminology, an assessment framework has been developed and validated in scope of an empirical study. Now, all different types of CDGs can be evaluated according to a defined and uniform set of assessment criteria and, thus, are comparable according to their characteristics and effectiveness.
An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest number k such that G admits such equitable k-coloring. We focus on enumerative algorithms for the computation of the equitable coloring number and propose a general scheme to derive pruning rules for them: We show how the extendability of a partial coloring into an equitable coloring can be modeled via network flows. Thus, we obtain pruning rules which can be checked via flow algorithms. Computational experiments show that the search tree of enumerative algorithms can be significantly reduced in size by these rules and, in most instances, such naive approach even yields a faster algorithm. Moreover, the stability, i.e., the number of solved instances within a given time limit, is greatly improved.
Since the execution of flow algorithms at each node of a search tree is time consuming, we derive arithmetic pruning rules (generalized Hall-conditions) from the network model. Adding these rules to an enumerative algorithm yields an even larger runtime improvement.