|
|
|
|
|
João Paulo Costalonga, Robert J. Kingan and Sandra R. Kingan
A 3-connected graph is minimally 3-connected if removal of any edge destroys 3-connectivity. We present an algorithm for constructing minimally 3-connected graphs based on the results in (Dawes, JCTB 40, 159-168, 1986) using two operations: adding an edg...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohd Samsudin Abdul Hamid, Nasir Shafiq and Osamah Kiwan
The concept of a sustainable environment generally refers to the development that creates a balance between the resources consumption pattern and the rate of depletion of natural resources. For determining the level of sustainability of any project, thre...
ver más
|
|
|
|
|
|
|
|
|
|
|
Giuseppe Lancia and Marcello Dalpasso
Given a Traveling Salesman Problem solution, the best 3-OPT move requires us to remove three edges and replace them with three new ones so as to shorten the tour as much as possible. No worst-case algorithm better than the T(??3)
T
(
n
3
)
enumeration o...
ver más
|
|
|
|
|
|
|
|
|
|
|
Florentin Smarandache and Jun Ye
Over a period of seven months (August 2017?February 2018), the Special Issue dedicated to ?Neutrosophic Information Theory and Applications? by the ?Information? journal (ISSN 2078-2489), located in Basel, Switzerland, was a success. The Guest Editors, P...
ver más
|
|
|
|
|
|
|
|
|
|
|
D. M. Kozachenko
Pág. 54 - 58
A model structure of track lay-out for simulation of the process of braking-up and making up of freight trains on the sorting humps is presented. The model is made on the basis of weighed directed graphs. The longitudinal hump profile is approximated by ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Calamoneri, T; Olariu, S; Petreschi, R
Pág. 1009 - 1018
|
|
|
|
|
|