#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2007

2016

- This year (0)
- Last 5 years (5)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Mihai Talmaciu, Elena Nechita
- Informatica, Lith. Acad. Sci.
- 2007

In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognition algorithm for the diamond-free graphs which keeps the combinatorial structure of the graph by means of the decomposition, as well as an easy possibility to determine the clique… (More)

In this paper we describe the first Ant algorithm designated for fuzzy TSP (FTSP). Our work consists of two parts. The former part is dedicated to FTSP specification. The latter transforms the Ant System (chronologically the first Ant algorithm) in order to tackle the FTSP, and implement the new algorithm on a FTSP instance.

- Mihai Talmaciu, Elena Nechita, Barna Iantovics
- Advances in Intelligent Analysis of Medical Data…
- 2013

- Mihai Talmaciu, Elena Nechita, Barna Iantovics
- Computing and Informatics
- 2013

In this paper we give a recognition algorithm in O(n(n + m)) time for bipartite chain graphs, and directly calculate the density of such graphs. For their stability number and domination number, we give algorithms comparable to the existing ones. We point out some applications of bipartite chain graphs in chemistry and approach the Minimum Chain Completion… (More)

During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset… (More)

- Elena Nechita
- Advanced Intelligent Computational Technologies…
- 2014

- Elena Nechita, Gloria-Cerasela Crisan, Sergiu-Madalin Obreja, Constantin-Sebastian Damian
- New Approaches in Intelligent Control
- 2016

- Elena Nechita
- 2010

This paper presents an overview of the results that have been obtained lately on seriality and synchronicity and their link, in the light of the new theories and within the frame of complexity science.

This extended abstract presents a synthesis of our work concerning a parallel algorithm for Vehicle Routing Problem with Time Windows (VRPTW). Two colonies work in parallel and cooperate to solve the problem, each one being charged with an objective of the optimization. In addition, the importance of these objectives can vary, depending on some… (More)