10 research outputs found
Local majorities, coalitions and monopolies in graphs: a review
AbstractThis paper provides an overview of recent developments concerning the process of local majority voting in graphs, and its basic properties, from graph theoretic and algorithmic standpoints
Complexity and algorithms related to two classes of graph problems
This thesis addresses the problems associated with conversions on graphs and editing by removing a matching. We study the f-reversible processes, which are those associated with a threshold value for each vertex, and whose dynamics depends on the number of neighbors with different state for each vertex. We set a tight upper bound for the period and transient lengths, characterize all trees that reach the maximum transient length for 2-reversible processes, and we show that determining the size of a minimum conversion set is NP-hard. We show that the AND-OR model defines a convexity on graphs. We show results of NP-completeness and efficient algorithms for certain convexity parameters for this new one, as well as approximate algorithms. We introduce the concept of generalized threshold processes, where the results are NP-completeness and efficient algorithms for both non relaxed and relaxed versions. We study the problem of deciding whether a given graph admits a removal of a matching in order to destroy all cycles. We show that this problem is NP-hard even for subcubic graphs, but admits efficient solution for several graph classes. We study the problem of deciding whether a given graph admits a removal of a matching in order to destroy all odd cycles. We show that this problem is NP-hard even for planar graphs with bounded degree, but admits efficient solution for some graph classes. We also show parameterized results.Esta tese aborda problemas associados a conversões em grafos e de edição pela remoção de um emparelhamento. Estudamos processos f-reversĂveis, que sĂŁo aqueles associados a um valor de limiar para cada vĂ©rtice e cuja dinâmica depende da quantidade de vizinhos com estado contrário para cada vĂ©rtice. Estabelecemos um limite superior justo para o tamanho do perĂodo e transiente, caracterizamos todas as árvores que alcançam o transiente máximo em processos 2-reversĂveis e mostramos que determinar o tamanho de um conjunto conversor mĂnimo Ă© NP-difĂcil. Mostramos que o modelo AND-OR define uma convexidade sobre grafos. Mostramos resultados de NP-completude e algoritmos eficientes para certos parâmetros de convexidade para esta nova, assim como algoritmos aproximativos. Introduzimos o conceito de processos de limiar generalizados, onde mostramos resultados de NP-completude e algoritmos eficientes para ambas as versões nĂŁo relaxada e relaxada. Estudamos o problema de decidir se um dado grafo admite uma remoção de um emparelhamento de modo a remover todos os ciclos. Mostramos que este problema Ă© NP-difĂcil mesmo para grafos subcĂşbicos, mas admite solução eficiente para várias classes de grafos. Estudamos o problema de decidir se um dado grafo admite uma remoção de um emparelhamento de modo a remover todos os ciclos Ămpares. Mostramos que este problema Ă© NP-difĂcil mesmo para grafos planares com grau limitado, mas admite solução eficiente para algumas classes de grafos. Mostramos tambĂ©m resultados parametrizados
Local Interaction on Random Graphs
We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction structure (represented by a deterministic graph or the realization of a random graph) cannot change over time
Optimal irreversible dynamos in chordal rings
In this paper, we study the effect of a simple majority rule on two classes of chordal rings: weakly and strongly chorded rings. In the case of weakly chorded rings, we establish a lower bound on the weight of optimal dynamos and we prove that the bound is tight with a constructive upper bound; we also provide a complete characterization of the optimal dynamos for the well-known class of double- and triple-loop networks. Also in the case of strongly chorded rings, we establish tight bounds and show how to construct optimal dynamos. © 2001 Elsevier Science B.V. All rights reserved.SCOPUS: ar.jinfo:eu-repo/semantics/publishe