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.
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 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)
Some problems related to security in communication networks lead to consider a new type of connectivity in graphs, namely the confidential connectivity. In this paper we present a characterization of unbreakable graphs using the notion of weak decomposition and we give some applications of minimal unbreakable graphs. In fact, we showed that a graph G is… (More)
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.