Results 61 to 70 of about 168,763 (311)
Working with Legacy Relational Data in A Graph-Based World
International Journal of Population Data Science, 2020 The Next Generation Linkage Management System (NGLMS) was designed around keeping all data in a graph database. However, this constraint, while easily achievable for greenfield projects and/or new data linkage units, may not be easily met where legacy ...
James Farrow
doaj +1 more source
Spanning forests, electrical networks, and a determinant identity [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 We aim to generalize a theorem on the number of rooted spanning forests of a highly symmetric graph to the case of asymmetric graphs. We show that this can be achieved by means of an identity between the minor determinants of a Laplace matrix, for which ...
Elmar Teufl, Stephan Wagner
doaj +1 more source
Exploration of graphs with excluded minors
Journal of Computer and System Sciencesto appear at ESA ...
Júlia Baligács +3 more
openaire +4 more sources
Journal of Combinatorial Theory, Series B, 1996 The main result of this series serves to reduce several problems about general graphs to problems about graphs which can “almost” be drawn in surfaces of bounded genus. In applications of the theorem we usually need to encode such a nearly embedded graph as a hypergraph which can be drawn completely in the surface.
Robertson, Neil, Seymour, P.D
openaire +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
Constructing internally 4-connected binary matroids
, 2012 This is the post-print version of the Article - Copyright @ 2013 ElsevierIn an earlier paper, we proved that an internally 4-connected binary matroid with at least seven elements contains an internally 4-connected proper minor that is at most six ...
Chun, Carolyn +8 more
core +1 more source
The Ceresa class and tropical curves of hyperelliptic type
Forum of Mathematics, SigmaWe define a new algebraic invariant of a graph G called the Ceresa–Zharkov class and show that it is trivial if and only if G is of hyperelliptic type, equivalently, G does not have as a minor the complete graph on four vertices or the loop of three ...
Daniel Corey, Wanlin Li
doaj +1 more source
Minor cutting edge force contribution in wood bandsawing
Journal of Wood Science, 2022 As the sawmill industry is moving towards thinner bandsaws for higher yields, it is important to study the cutting force in more detail. The cutting force can be split into two zones.
Vanessa Meulenberg +3 more
doaj +1 more source
Bipartite graphs with no K6 minor
Journal of Combinatorial Theory, Series BA theorem of Mader shows that every graph with average degree at least eight has a $K_6$ minor, and this is false if we replace eight by any smaller constant. Replacing average degree by minimum degree seems to make little difference: we do not know whether all graphs with minimum degree at least seven have $K_6$ minors, but minimum degree six is ...
Chudnovsky, M +3 more
openaire +5 more sources
On the geometry of graphs with a forbidden minor [PDF]
Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009 We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture to a pair of manifestly simpler conjectures. The GNRS conjecture characterizes all graphs that have an O(1)-approximate multi-commodity max-flow/min-cut theorem. In particular,
James R. Lee, Anastasios Sidiropoulos
openaire +1 more source