Results 91 to 100 of about 87,870 (251)
Homomorphic Preimages of Geometric Cycles
, 2015 A graph G is a homomorphic preimage of another graph H, or equivalently G is H-colorable, if there exists a graph homomorphism from G to H. A classic problem is to characterize the family of homomorphic preimages of a given graph H.
Cockburn, Sally
core
Completeness results for graph isomorphism
Journal of Computer and System Sciences, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jenner, Birgit +3 more
openaire +2 more sources
Mission Aware Cyber‐Physical Security
Systems Engineering, EarlyView.ABSTRACT Perimeter cybersecurity, while essential, has proven insufficient against sophisticated, coordinated, and cyber‐physical attacks. In contrast, mission‐centric cybersecurity emphasizes finding evidence of attack impact on mission success, allowing for targeted resource allocation to mitigate vulnerabilities and protect critical assets.
Georgios Bakirtzis +3 more
wiley +1 more source
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
International Journal of Mathematics and Mathematical Sciences, 2008 We provide a process to extend any bipartite diametrical graph of diameter 4 to an 𝑆-graph of the same diameter and partite sets. For a bipartite diametrical graph of diameter 4 and partite sets 𝑈 and 𝑊, where 2𝑚=|𝑈|≤|𝑊|, we prove that 2𝑚 is a sharp ...
Salah Al-Addasi, Hasan Al-Ezeh
doaj +1 more source
Trivalent Graph isomorphism in polynomial time [PDF]
, 2012 It's important to design polynomial time algorithms to test if two graphs are isomorphic at least for some special classes of graphs. An approach to this was presented by Eugene M. Luks(1981) in the work \textit{Isomorphism of Graphs of Bounded Valence
Mena, Adria Alcala
core +2 more sources
Business Ethics, the Environment &Responsibility, EarlyView.ABSTRACT The communication of sustainable development is essential for higher education institutions (HEIs), which voluntarily prepare sustainability reports (SRs) to demonstrate commitment and inform strategic decision‐making. This study conducts a systematic literature review (SLR) to identify and analyze the challenges associated with implementing ...
Valerio Brescia +3 more
wiley +1 more source
On the Complexity of Polytope Isomorphism Problems
, 2002 We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a polynomial time
Kaibel, Volker, Schwartz, Alexander
core +3 more sources
Quantum Algorithms for Tree Isomorphism and State Symmetrization [PDF]
, 2010 The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case.
Rosenbaum, David
core
Artificial intelligence streamlines scientific discovery of drug–target interactions
British Journal of Pharmacology, EarlyView.Abstract Drug discovery is a complicated process through which new therapeutics are identified to prevent and treat specific diseases. Identification of drug–target interactions (DTIs) stands as a pivotal aspect within the realm of drug discovery and development. The traditional process of drug discovery, especially identification of DTIs, is marked by
Yuxin Yang, Feixiong Cheng
wiley +1 more source
Graph Theory Students’ Perceptions of Graph Isomorphism [PDF]
Iranian Journal of Educational ResearchObjective: Graph isomorphism is a central topic in graph theory, yet students often struggle to grasp its underlying principles. This study aimed to explore students' perceptions of graph isomorphism and identify the conceptual metaphors they employ when
Ali Jafari +2 more
doaj