Results 61 to 70 of about 615,797 (257)
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source
AI-enabled engineering of hesperidin/ursodeoxycholic acid nanomedicine for synergistic treatment of drug-induced liver injury. [PDF]
Smart MolAn AI‐driven framework integrating disease‐network analysis, direction‐aware molecular screening, and carrier‐free co‐assembly engineering enables nanomedicine design. The dual‐constraint deep learning model predicts API–target affinity and regulatory direction to prioritize complementary APIs.
Xiao K +14 more
europepmc +2 more sources
, 2019 In this article we review some of the most relevant properties related to graph isomorphism and graph components. We start by introducing some concepts related to graph traversal (walks, paths, cycles, circuits), then we introduce two natural concepts ...
Dondi, Riccardo
core +1 more source
Exploiting Ferroelectric and Spintronic Dynamics for Neural Network Computation
Advanced Intelligent Systems, EarlyView.Ferroelectric and spintronic devices, relying on the control of polarization and magnetization, offer intrinsically fast, durable, energy‐efficient, and low‐latency building blocks for analog in‐memory computing. The hysteretic dynamics of an order parameter are leveraged to provide nonvolatile, multistate memory and nonlinear switching. Brain‐inspired
Dashiell Harrison +4 more
wiley +1 more source
Old and new generalizations of line graphs
International Journal of Mathematics and Mathematical Sciences, 2004 Line graphs have been studied for over seventy years. In 1932, H. Whitney showed that for connected graphs, edge-isomorphism implies isomorphism except for K3 and K1,3.
Jay Bagga
doaj +1 more source
Constructing Hard Examples for Graph Isomorphism
Journal of Graph Algorithms and Applications, 2019 We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial automorphisms which
Anuj Dawar, Kashif Khan
doaj +1 more source
Exploiting Edge Semantics in Job Shop Scheduling Problem With Heterogeneous Graph Transformers
Advanced Intelligent Systems, EarlyView.A heterogeneous graph transformer (HGT) is introduced for reinforcement learning‐based job shop scheduling by explicitly distinguishing precedence and machine‐contention relations through edge‐type‐specific attention. The proposed framework learns richer scheduling representations, improves decision quality over homogeneous graph models, and highlights
Bulent Soykan, Fatih Kasimoglu
wiley +1 more source
Graph isomorphism—Characterization and efficient algorithms
High-Confidence ComputingThe Graph isomorphism problem involves determining whether two graphs are isomorphic and the computational complexity required for this determination. In general, the problem is not known to be solvable in polynomial time, nor to be NP-complete.
Jian Ren, Tongtong Li
doaj +1 more source
Planar Graphs under Pythagorean Fuzzy Environment
Mathematics, 2018 Graph theory plays a substantial role in structuring and designing many problems. A number of structural designs with crossings can be found in real world scenarios. To model the vagueness and uncertainty in graphical network problems, many extensions of
Muhammad Akram +2 more
doaj +1 more source
Advances in Mechanical Engineering, 2022 Isomorphism identification is an essential step in the structure synthesis of Kinematic Chain (KC), and needs a large amount of analysis and calculation.
Liangbo Sun +5 more
doaj +1 more source