Results 171 to 180 of about 43,326 (227)
Emendation of Recommendation 6(7), Rule 64 and Appendix 9 Section D of the International Code of Nomenclature of Prokaryotes to regulate the formation of prokaryote names from personal names. [PDF]
Int J Syst Evol MicrobiolOren A.
europepmc +1 more source
Developing a cognitive model of solid geometry based on Interpretive Structural Modeling method. [PDF]
HeliyonZhang H, Wu X, Ju M.
europepmc +1 more source
Multiple biometric authentication for online banking system based on multiple fuzzy approach. [PDF]
Sci RepAnwar NM +4 more
europepmc +1 more source
Critical success factors for successful technology innovation development in sustainable energy enterprises. [PDF]
Sci RepAlka TA, Raman R, Suresh M.
europepmc +1 more source
CHATGPT FOR COMPUTATIONAL TOPOLOGY. [PDF]
Found Data SciLiu J, Shen L, Wei GW.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Enumeration of connected components of acyclic digraph
Journal of Discrete Mathematical Sciences and Cryptography, 2021We established the concept of a binary reflexive relation of adjacency and determined the algebraic system consisting of all binary relations of set X and all unordered pairs of binary relations in terms of characteristic functions on the set of all ...
K. Al'Dzhabri
semanticscholar +1 more source
Anais do XXXVI Concurso de Teses e Dissertações (CTD 2023), 2022
In 1982, Berge defined the class of χ-diperfect digraphs. A digraph D is χ-diperfect if for every induced subdigraph H of D and every minimum coloring S of H there exists a path P of H with exactly one vertex of each color class of S. Berge also showed examples of non-χ-diperfect orientations of odd cycles and their complements.
Caroline Aparecida de Paula Silva +2 more
openaire +1 more source
In 1982, Berge defined the class of χ-diperfect digraphs. A digraph D is χ-diperfect if for every induced subdigraph H of D and every minimum coloring S of H there exists a path P of H with exactly one vertex of each color class of S. Berge also showed examples of non-χ-diperfect orientations of odd cycles and their complements.
Caroline Aparecida de Paula Silva +2 more
openaire +1 more source
Congestion recognition for hybrid urban road systems via digraph convolutional network
, 2020Congestion recognition is the prerequisite for traffic control and management, vehicle routing, and many other applications in intelligent transportation systems.
Xiao Han +3 more
semanticscholar +1 more source
Journal of Graph Theory, 2014
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Andres, Stephan Dominique +1 more
openaire +2 more sources
AbstractThe clique number of a digraph D is the size of the largest bidirectionally complete subdigraph of D. D is perfect if, for any induced subdigraph H of D, the dichromatic number defined by Neumann‐Lara (The dichromatic number of a digraph, J. Combin. Theory Ser. B 33 (1982), 265–270) equals the clique number .
Andres, Stephan Dominique +1 more
openaire +2 more sources