Results 41 to 50 of about 3,369,792 (260)
Dataflow graphs as complete causal graphs
2023 IEEE/ACM 2nd International Conference on AI Engineering – Software Engineering for AI (CAIN), 2023 Accepted to 2nd International Conference on AI Engineering - Software Engineering for AI (CAIN 23)
Andrei Paleyes +3 more
openaire +3 more sources
Covid-Graph-Repository: Graph Dumps and Topology Results
, 2021 Paper title: Optimized Construction of Covid-19 Datasets for GraphAnalytics This repository contains a number of Covid-19 graph database dumps. - Graph-Dumps/1-Dimensional-Graph.dump: This includes metamodel transformation, node compression and binning.
Mark Roantree +3 more
core +1 more source
Chip-Firing on the Complete Split Graph: Motzkin Words and Tiered Parking Functions [PDF]
, 2023 EuroComb 2021: Online European Conference on Combinatorics, Graph Theory and Applications, Barcelona, Spain, 6-10 September 2021We highlight some results from studying chip-firing on the the complete split graph [5].
Dukes, Mark
core +1 more source
Dynamics, 2023 Ramsey theory constitutes the dynamics of mechanical systems, which may be described as abstract complete graphs. We address a mechanical system which is completely interconnected by two kinds of ideal Hookean springs.
Nir Shvalb +3 more
doaj +1 more source
On the bigenus of the complete graphs
Australas. J Comb., 2021 We describe an infinite family of edge-decompositions of complete graphs into two graphs, each of which triangulate the same orientable surface. Previously, such decompositions had only been known for only a few complete graphs. These so-called biembeddings solve a generalization of the Earth-Moon problem for an infinite number of orientable surfaces.
openaire +4 more sources
Capturing Topology in Graph Pattern Matching [PDF]
, 2011 Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +11 more
core +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Decomposing the Complete Graph Into Hamiltonian Paths (Cycles) and 3-Stars
Discussiones Mathematicae Graph Theory, 2020 Let H be a graph. A decomposition of H is a set of edge-disjoint subgraphs of H whose union is H. A Hamiltonian path (respectively, cycle) of H is a path (respectively, cycle) that contains every vertex of H exactly once.
Lee Hung-Chih, Chen Zhen-Chun
doaj +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 more
wiley +1 more source
The Reliability of a Class of Two-Layer Networks with Unreliable Edges
AxiomsIt is well known that networks are dynamic graphs, and the topology of a network can be described by a graph. Thus, the reliability of a network under edge failure is defined as the probability that its corresponding topological graph remains connected ...
Sun Xie, Haixing Zhao, Jun Yin
doaj +1 more source