Results 71 to 80 of about 926,750 (319)
Long Dominating Cycles in Graphs [PDF]
, 2007 All graphs considered in this paper will be finite and simple.
Zhiren, Sun, Yongga, A.
core +1 more source
Revista Digital Matemática, Educación e InternetEste artículo presenta un libro interactivo de estadística destinado al tercer año de primaria, dirigido a niños y niñas de entre 8 y 9 años aproximadamente.
Carlos Monge Madriz +3 more
doaj +1 more source
Solving the Large-Scale TSP Problem in 1 h: Santa Claus Challenge 2020
Frontiers in Robotics and AI, 2021 The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to submit their algorithms to solve a ...
Radu Mariescu-Istodor, Pasi Fränti
doaj +1 more source
Artificial Intelligence, 2017 Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference orders), when consolidating conflicting views regarding ...
Ulle Endriss, Umberto Grandi
openaire +7 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
The n-th Power Signed Graphs-II [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary [6]; the non-standard will be given in this paper as and when required.
Reddyy, P. Siva Kota +2 more
core +1 more source
Binary Numeration System with Alternating Signed Digits and Its Graph Theoretical Relationship
AlgorithmsThe binary number system is the basic number representation in computing. We can encode natural numbers with finite 0-1 sequences. The representation of natural numbers is based on this system. However, this poses problems and is technically not perfect.
Péter Hajnal
doaj +1 more source
Temporal Graph Traversals Using Reinforcement Learning With Proximal Policy Optimization
IEEE Access, 2020 Graphs in real-world applications are dynamic both in terms of structures and inputs. Information discovery in such networks, which present dense and deeply connected patterns locally and sparsity globally can be time consuming and computationally costly.
Samuel Henrique Silva +2 more
doaj +1 more source
An isoform of 14‐3‐3 protein regulates transbilayer lipid movement at the plasma membrane
FEBS Letters, EarlyView.Loss of 14‐3‐3ζ in CHO cells confers resistance to exogenous phosphatidylserine (PS) and impairs endocytosis‐independent inward flip‐flop of fluorescent PS at the plasma membrane. RNAi‐mediated knockdown reproduces this defect, while no additive effect is seen in ATP11C‐deficient cells.
Akiko Yamaji‐Hasegawa +3 more
wiley +1 more source
, 2000 We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph which is reducible by some finite sequence of these moves, to a graph with no edges is called a knot graph.
Welsh, D J A +13 more
core +1 more source