Results 61 to 70 of about 1,986,691 (177)
Chordal bipartite completion of colored graphs [PDF]
, 2007 Golumbic, Kaplan, and Shamir [Graph sandwich problems, J. Algorithms 19 (1995) 449–473], in their paper on graph sandwich problems published in 1995, left the status of the sandwich problems for strongly chordal graphs and chordal bipartite graphs open ...
R. Sritharan, Sritharan, R.
core +1 more source
Journal of Plant Nutrition and Soil Science, EarlyView.We provide a historic overview of microscopic soil structure characterization from its founding father, Walter Kubiëna, to several technical revolutions like automation, digitalization, and artificial intelligence. In addition to technical advancements, we explore how concepts and research questions have evolved in time.
Steffen Schlüter +3 more
wiley +1 more source
Is DNA metabarcoding an option for formaldehyde‐preserved zooplankton time series?
Limnology and Oceanography: Methods, EarlyView.Abstract The recovery of amplifiable DNA from formaldehyde‐fixed (FF) zooplankton samples has long been considered problematic, but advances in degraded‐DNA retrieval have renewed interest in FF samples. To access the information stored in long‐term zooplankton time series, we evaluated methods for extracting amplifiable DNA from community samples ...
Aitor Albaina +4 more
wiley +1 more source
Chordal Graph Models of Contingency Tables [PDF]
, 1997 Chordal graph theory has recently found application by statisticians in the analysis of contingency tables. Specifically, what are called \u27\u27decomposable loglinear models\u27\u27 correspond exactly to chordal graphs.
McKee, T.A. +3 more
core +1 more source
Journal of Field Robotics, EarlyView.ABSTRACT Uncrewed underwater vehicles (UUVs) have transformed oceanographic research through autonomous data gathering. Similarly, lake and other aquatic research can potentially be automated and transformed. However, UUVs would need to be smaller, lighter, less complex, and cheaper than currently available to make them more practical and user‐friendly
James M Rand +3 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
, 2004 This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Ryuhei Uehara, et al.
core
Science Education, EarlyView.ABSTRACT Opening space for students to help shape knowledge building practices in the classroom—that is, epistemic agency—is necessary to achieve a variety of goals held by the science education community. As such, many scholars have explored how students might be positioned with, perceive, and take up epistemic agency.
Brie A. Bradshaw +2 more
wiley +1 more source
Integrative Zoology, EarlyView.Cold exposure triggers enhanced huddling responses in golden snub‐nosed monkeys, characterized by increased huddling frequency, duration, and larger group formation. Huddling effectively improves thermal regulation by elevating body surface temperature and reducing heat loss, with individuals inside aggregations achieving greater thermal benefits than ...
Yongbo Li +12 more
wiley +1 more source
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core
Domination, independent domination, and duality in strongly chordal graphs [PDF]
, 1984 We present polynomial algorithms to locate minimum weight dominating sets and independent dominating sets in strongly chordal graphs. We utilize an intimate relationship between strongly chordal graphs and totally balanced matrices to show that the ...
Farber, Martin, Martin Farber
core +1 more source