A5009552803- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
- Limits and Structures in Graph Theory
- Interconnection Networks and Systems
- Optimization and Search Problems
- Graph theory and applications
- Quantum Computing Algorithms and Architecture
- Nuclear Receptors and Signaling
- Vehicle Routing Optimization Methods
- Genome Rearrangement Algorithms
- Computability, Logic, AI Algorithms
- Graph Theory and Algorithms
- graph theory and CDMA systems
- Transportation Planning and Optimization
- Advanced Optical Network Technologies
- Complex Network Analysis Techniques
- Constraint Satisfaction and Optimization
- Data Management and Algorithms
- Digital Image Processing Techniques
- Algorithms and Data Compression
- Quantum Information and Cryptography
- Computational Physics and Python Applications
- Topological and Geometric Data Analysis
- Computational Geometry and Mesh Generation
Universidade Federal de Minas Gerais
2017-2024
Universidade Presidente Antônio Carlos
2021
Universidade Luterana do Brasil
2020
Fundação de Ciência e Tecnologia
2020
Federal Center for Technological Education of Minas Gerais
2015-2018
Universidade do Estado do Rio de Janeiro
2014-2016
Sociedade Brasileira de Educação Matemática
2015
Universidade Federal do Rio de Janeiro
2011-2013
In May of 2016, IBM Research has made a quantum processor available in the cloud to general public. The possibility programming an actual device elicited much enthusiasm. Yet, still lacks compiler support that modern languages enjoy today. To use universal computers like IBM's, programmers must design low-level circuits. particular, they map logical qubits into physical need obey connectivity constraints. This task resembles early days programming, which software was built machine languages....
In 2016, the first quantum processors have been made available to general public. The possibility of programming an actual device has elicited much enthusiasm. Yet, such also brought challenges. One challenge is so called Qubit Allocation problem: mapping a virtual circuit into architecture. There exist solutions this problem; however, in our opinion, they fail capitalize on decades improvements graph theory. contrast, paper shows how model qubit allocation as combination Subgraph...
We present the first results on complexity of reconfiguration vertex separators under three most popular rules: token addition/removal, jumping (TJ), and sliding (TS). show that, aside from some trivially negative instances, two rules are equivalent to each other even if only a subclass bipartite graphs, TS is not unless NP=PSPACE; we do this by showing relationship between independent sets in graphs. In terms polynomial time algorithms, that every class with polynomially bounded number...
In this work we tackle the bus stop selection step for School Bus Routing Problem (SBRP). Our goal is to minimize number of stops in order assign all students a respecting home-to-bus-stop walking distance constraint. strategy creates large possible points road network and uses pseudo-random constructive heuristic algorithm stops. approach tested on real georeferenced data Brazilian city compared with different methodology. Results demonstrate that proposed able find good solutions...
In recent times, several activities that lately were considered possible to do only by human work, have been replaced the use of artificial intelligence. Recent researches developed give computers a creativity ability as main objective. A type related research is algorithmic composition. Traditionally evolutionary algorithms are successfully used for composing tasks, using wide variety fitness functions. This work presents multiobjective approach combines Fux's rules, from music theory, and...
A graph on $n$ vertices is equitably $k$-colorable if it and every color used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil \right\rceil$ times. Such a problem appears to be considerably harder than vertex coloring, being $\mathsf{NP\text{-}Complete}$ even for cographs interval graphs. In this work, we prove that $\mathsf{W[1]\text{-}Hard}$ block graphs disjoint union of split when parameterized by the number colors; $K_{1,4}$-free treewidth, colors maximum degree, generalizing...
Biodiesel made from oils is rich in polyunsaturated fatty acids methyl esters, and, consequently, presents high tendency to oxidize.Biodiesel fats, on the other hand, mainly comprised by saturated chains.Although it highly stable, they easily crystalize at low temperatures.Blends both can exhibit optimized properties.In this work, oxidative stability, expressed induction period (IP), and cold filter plugging point (CFPP) of blends palm, palm kernel, babassu, tallow or lard biodiesels with...
For a fixed property (graph class) Π, given graph G and an integer k, the Π-deletion problem consists in deciding if we can turn into with Π by deleting at most k edges. The is known to be NP-hard for of well-studied classes, such as chordal, interval, bipartite, planar, comparability permutation graphs, among others; even deletion cacti general graphs. However, there notable exception: trees polynomial. Motivated this fact, study some classes similar trees, addressing way knowledge gap...
In this work we address the Firefighter problem in graphs and its relationship with bandwidth parameter bw(G) of a graph G. The consists scenario which vertex v is initially set on fire, call focus fire. objective to defend largest number vertices not fire firefighters, protecting by vertex, as spreads after each new defense. minimum natural number, such that it found an optimal linear arrangement vertices, distance between indices smallest possible. We relate find lower bound maximum saved from
Arranjos musicais têm sido tratados recentemente do ponto de vista combinatório. Esses problemas consideram uma partitura com um número dado pautas correspondentes aos instrumentos participantes. O objetivo é selecionar certo que atendam a algumas propriedades específicas. Neste trabalho, são propostos dois novos decisão para arranjo musical, o ARRANJO PARA k INSTRUMENTOS e PREENCHIMENTO DE TEMPOS POR INSTRUMENTOS. É provado ambos os NP-completos.