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 i...
Graphs are at the essence of many data representations. The visual analytics over graphs is usually ...
This work is framed within the eld of Graph Theory, speci cally in the area of graph coloring. Our...
Graph theory is a mathematical tool used in solving many algorithmic and computational problems in t...
A maximum stable set is a stable set with the largest possible size, for a given graph G. This size...
Edge colouring, a problem which consists in figuring out how many colours are needed to provide a m...
Tribunal: Alex Bronstein (Tel Aviv University), Marcelo Lanzilotta (Universidad de la República), Go...
Este artigo apresenta uma revisão sistemática da literatura sobre os resultados e aplicações do núme...
This thesis is devoted to exact solution methods for NP-hard integer programming models. We conside...
[EN] In graph theory, networks play an important role in a lot of type of problems. In this paper we...
National audienceThe question of tractable classes of constraint satisfaction problems (CSPs) has be...
The notion of Tree Decomposition was introduced by Robertson and Seymour in their seris of articles ...
The recent innovations in Machine Learning techniques have led to a large utilization of intelligent...
This thesis discusses events of genome rearrangements problems: transposition, breakpoint, block int...
The problem to ?nd the minimum of colors that are necessary to color all edges on a graph G, known a...
TCC(graduação) - Universidade Federal de Santa Catarina. Centro Tecnológico. Ciências da Computação....
Graphs are at the essence of many data representations. The visual analytics over graphs is usually ...
This work is framed within the eld of Graph Theory, speci cally in the area of graph coloring. Our...
Graph theory is a mathematical tool used in solving many algorithmic and computational problems in t...
A maximum stable set is a stable set with the largest possible size, for a given graph G. This size...
Edge colouring, a problem which consists in figuring out how many colours are needed to provide a m...
Tribunal: Alex Bronstein (Tel Aviv University), Marcelo Lanzilotta (Universidad de la República), Go...
Este artigo apresenta uma revisão sistemática da literatura sobre os resultados e aplicações do núme...
This thesis is devoted to exact solution methods for NP-hard integer programming models. We conside...
[EN] In graph theory, networks play an important role in a lot of type of problems. In this paper we...
National audienceThe question of tractable classes of constraint satisfaction problems (CSPs) has be...
The notion of Tree Decomposition was introduced by Robertson and Seymour in their seris of articles ...
The recent innovations in Machine Learning techniques have led to a large utilization of intelligent...
This thesis discusses events of genome rearrangements problems: transposition, breakpoint, block int...
The problem to ?nd the minimum of colors that are necessary to color all edges on a graph G, known a...
TCC(graduação) - Universidade Federal de Santa Catarina. Centro Tecnológico. Ciências da Computação....
Graphs are at the essence of many data representations. The visual analytics over graphs is usually ...
This work is framed within the eld of Graph Theory, speci cally in the area of graph coloring. Our...
Graph theory is a mathematical tool used in solving many algorithmic and computational problems in t...