Results 291 to 300 of about 937,585 (316)
Large Language Model and Knowledge Graph-Driven AJCC Staging of Prostate Cancer Using Pathology Reports. [PDF]
Diagnostics (Basel)Jo E, Noh TI, Joo HJ.
europepmc +1 more source
Breaking barriers in ICD classification with a robust graph neural network for hierarchical coding. [PDF]
Sci RepXi S +7 more
europepmc +1 more source
Trends in immune cell profiles of osteomyelitis: a clinical study supported by Mendelian randomization analysis. [PDF]
Front Med (Lausanne)Liu Z +7 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Methods of Operations Research, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julio Kuplinsky +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Julio Kuplinsky +2 more
openaire +2 more sources
AIP Conference Proceedings, 2019
This article discusses a mixed graph called mixed hourglass graph. The adjacency of a mixed hourglass graph is coined from an hourglass matrix in which the matrix is obtained from quadratic interlocking factorization. Mixed hourglass graph is a weighted graph with loops, but replacing the weights of the graph with 1’s produce an unweighted mixed ...
Olayiwola Babarinsa +1 more
openaire +2 more sources
This article discusses a mixed graph called mixed hourglass graph. The adjacency of a mixed hourglass graph is coined from an hourglass matrix in which the matrix is obtained from quadratic interlocking factorization. Mixed hourglass graph is a weighted graph with loops, but replacing the weights of the graph with 1’s produce an unweighted mixed ...
Olayiwola Babarinsa +1 more
openaire +2 more sources
Linear and Multilinear Algebra, 2017
A mixed complete graph is obtained from a directed cycle of length at least three by adding all the possible arcs between any non-adjacent vertices of the underlying cycle. A mixed block graph is a strongly connected directed graph whose blocks are mixed complete graphs. In this paper, we give the inverse of the distance matrix of the mixed block graph.
Qi Ding, Hui Zhou
openaire +2 more sources
A mixed complete graph is obtained from a directed cycle of length at least three by adding all the possible arcs between any non-adjacent vertices of the underlying cycle. A mixed block graph is a strongly connected directed graph whose blocks are mixed complete graphs. In this paper, we give the inverse of the distance matrix of the mixed block graph.
Qi Ding, Hui Zhou
openaire +2 more sources
On negative cycles in mixed graphs
Operations Research Letters, 1985It is shown that for mixed graphs, i.e., graphs having both directed and undirected edges, with a length function defined on the edges, the problems of detecting negative cycles and of finding the shortest path in the absence of negative cycles are NP-complete.
Christos H. Papadimitriou +1 more
openaire +3 more sources
1994
All of the situations considered earlier can be interpreted in terms of resource-constrained project scheduling. To do so, we introduce the concept of an Operation as some process having a certain duration and consuming certain resources. Each two operations may be either dependent or independent in the sense that the calendar time of one of them ...
Y. N. Sotskov +2 more
openaire +2 more sources
All of the situations considered earlier can be interpreted in terms of resource-constrained project scheduling. To do so, we introduce the concept of an Operation as some process having a certain duration and consuming certain resources. Each two operations may be either dependent or independent in the sense that the calendar time of one of them ...
Y. N. Sotskov +2 more
openaire +2 more sources
Optimal Mixed Graph Augmentation
SIAM Journal on Computing, 1987We consider an augmentation problem on mixed graphs that generalizes and unifies two augmentation problems considered by \textit{K. P. Eswaran} and \textit{R. E. Tarjan} [ibid. 5, 653-665 (1976; Zbl 0346.05112)]. The mixed augmentation problem has applications in the design of communication networks, and forms of mixed augmentation problem are central ...
openaire +2 more sources
Organic mixed conductors for bioinspired electronics
Nature Reviews Materials, 2023Paschalis Gkoupidenis +2 more
exaly