Computational complexity of covering three-vertex multigraphs
نویسندگان
چکیده
منابع مشابه
Computational Complexity of Covering Three-Vertex Multigraphs
A covering projection from a graph G to a graph H is a mapping of the vertices of G to the vertices of H such that, for every vertex v of G, the neighborhood of v is mapped bijectively to the neighborhood of its image. Moreover, if G and H are multigraphs, then this local bijection has to preserve multiplicities of the neighbors as well. The notion of covering projection stems from topology, bu...
متن کاملComputational Complexity in Three Areas of Computational Social Choice: Possible Winners, Unidirectional Covering Sets, and Judgment Aggregation
This thesis studies the computational complexity of different problems from three areas of computational social choice. The first one is voting, and especially the problem of determining whether a distinguished candidate can be a winner in an election with some kind of incomplete information. The second setting is in the broader sense related to the problem of determining winners. Here the comp...
متن کاملCapacitated vertex covering
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph G = (V ,E) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we pay the weight of the vertex and cover up to a pre-specified number of edges incident on this ver...
متن کاملComputational complexity of the average covering tree value
In this paper we prove that calculating the average covering tree value recently proposed as a single-valued solution of graph games is #P-complete.
متن کاملComputational analysis of three-dimensional epithelial morphogenesis using vertex models.
The folding of epithelial sheets, accompanied by cell shape changes and rearrangements, gives rise to three-dimensional structures during development. Recently, some aspects of epithelial morphogenesis have been modeled using vertex models, in which each cell is approximated by a polygon; however, these models have been largely confined to two dimensions. Here, we describe an adaptation of thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.09.013