Results 1 to 10 of about 3,087,593 (348)
Turán Problems for Mixed Graphs [PDF]
Journal of Combinatorial Theory, Series B, 2022 We investigate natural Turán problems for mixed graphs, generalizations of graphs where edges can be either directed or undirected. We study a natural \textit{Turán density coefficient} that measures how large a fraction of directed edges an $F$-free mixed graph can have; we establish an analogue of the Erdős-Stone-Simonovits theorem and give a ...
Nitya Mani, Edward Yu
openalex +4 more sources
Mixed graph colouring as scheduling multi-processor tasks with equal processing times
Журнал Белорусского государственного университета: Математика, информатика, 2021 A problem of scheduling partially ordered unit-time tasks processed on dedicated machines is formulated as a mixed graph colouring problem, i. e., as an assignment of integers (colours) {1, 2, …, t} to the vertices (tasks) V {ν1, ν2, …, νn}, of the mixed
Yuri N. Sotskov
doaj +2 more sources
MiDi: Mixed Graph and 3D Denoising Diffusion for Molecule Generation [PDF]
ECML/PKDD, 2023 This work introduces MiDi, a novel diffusion model for jointly generating molecular graphs and their corresponding 3D arrangement of atoms. Unlike existing methods that rely on predefined rules to determine molecular bonds based on the 3D conformation ...
Clément Vignac +3 more
openalex +3 more sources
Mixed Graph Colorings: A Historical Review
Mathematics, 2020 This paper presents a historical review and recent developments in mixed graph colorings in the light of scheduling problems with the makespan criterion. A mixed graph contains both a set of arcs and a set of edges. Two types of colorings of the vertices
Yuri N. Sotskov
doaj +2 more sources
Parameterized Mixed Graph Coloring [PDF]
Journal of Combinatorial Optimization, 2019 Coloring of mixed graphs that contain both directed arcs and undirected edges is relevant for scheduling of unit-length jobs with precedence constraints and conflicts. The classic GHRV theorem (attributed to Gallai, Hasse, Roy, and Vitaver) relates graph
P. Damaschke
semanticscholar +2 more sources
Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2) [PDF]
Frontiers in Physics, 2020 Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj +2 more sources
Inverse neutrosophic mixed graphs [PDF]
Journal of Fuzzy Extension and ApplicationsThis article successfully attempts to introduce the notion of Inverse Neutrosophic Mixed Graphs (INMG) together with its applications. This novel approach highlights the network modeling of real physical situations with indeterminacy.
Thempaavai Jayaprakash +1 more
doaj +2 more sources
Ratio Mathematica, 2022 A new form of picture fuzzy graph has been identified and introduced here as Mixed Picture Fuzzy Graph(MPFG). The picture fuzzy set is made up of the fuzzy set and the intuitionistic fuzzy set.
K.K. Myithili, C. Nandhini
doaj +2 more sources
Multi-Scale Mixed Dense Graph Convolution Network for Skeleton-Based Action Recognition
IEEE Access, 2021 In skeleton-based action recognition, the approaches based on graph convolutional networks(GCN) have achieved remarkable performance by modeling spatial-temporal graphs to explore the physical dependencies between body joints.
Hailun Xia, Xinkai Gao
doaj +2 more sources
γ-Inverse graph of some mixed graphs
Special MatricesLet GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa +2 more
doaj +2 more sources