|
|
|
|
|
Yu-Hung Chang, Chien-Hung Liu and Shingchern D. You
The dynamic flexible job-shop problem (DFJSP) is a realistic and challenging problem that many production plants face. As the product line becomes more complex, the machines may suddenly break down or resume service, so we need a dynamic scheduling frame...
ver más
|
|
|
|
|
|
|
|
|
|
|
Fangling Leng, Fan Li, Yubin Bao, Tiancheng Zhang and Ge Yu
As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the...
ver más
|
|
|
|
|
|
|
|
|
|
|
Tao Zhou, Liang Luo, Yuanxin He, Zhiwei Fan and Shengchen Ji
The panel block is a quite important ?intermediate product? in the shipbuilding process. However, the assembly efficiency of the panel block assembly line is not high. Therefore, rational scheduling optimization is of great significance for improving shi...
ver más
|
|
|
|
|
|
|
|
|
|
|
Zhiqiong Wang, Zican Lin, Shuo Li, Yibo Wang, Weiying Zhong, Xinlei Wang and Junchang Xin
Alzheimer?s disease (AD) is a progressive, irreversible neurodegenerative disorder that requires early diagnosis for timely treatment. Functional magnetic resonance imaging (fMRI) is a non-invasive neuroimaging technique for detecting brain activity. To ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Swarnendu Ghosh, Teresa Gonçalves and Nibaran Das
Conceptual representations of images involving descriptions of entities and their relations are often represented using scene graphs. Such scene graphs can express relational concepts by using sets of triplets ⟨subject—predicate&...
ver más
|
|
|
|
|
|
|
|
|
|
|
Sergey Kurapov,Maxim Davidovsky
Pág. 1 - 8
In general, a universal algorithm for testing a pair of graphs G and H for isomorphism exists. It is grounded on the fact that the rows and the corresponding columns of the adjacency matrix of the graph G can be rearranged until it turns into another, eq...
ver más
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
Stefano Quer, Andrea Marcelli and Giovanni Squillero
The maximum common subgraph of two graphs is the largest possible common subgraph, i.e., the common subgraph with as many vertices as possible. Even if this problem is very challenging, as it has been long proven NP-hard, its countless practical applicat...
ver más
|
|
|
|
|
|
|
|
|
|
|
I.A.K. Kamil,M.B. Abrosimov,A.A. Lobov
Pág. 54 - 58
In 1976 John Hayes proposed a graph-based model to investigate node fault tolerance of discrete systems. A graph G* is vertex k-extension of a graph G if after removing any k vertices from G* result graph contains G. A vertex k-extension of the graph G i...
ver más
|
|
|
|
|
|
|
|
|
|
|
A. S. Belozerov,B. F. Melnikov,N. P. Churikova
Pág. 23 - 30
The unsolved problem of isomorphism of graphs is directly related to one of seven so-called millenium problems: with the problem of equality of classes P and NP from the theory of algorithms. The reason of this is a lack of a sertificate algorithm for te...
ver más
|
|
|
|
|
|