Results 141 to 150 of about 96,628 (243)
Completing Partial k‐Star Designs
Journal of Combinatorial Designs, Volume 33, Issue 12, Page 446-455, December 2025.ABSTRACT A k‐star is a complete bipartite graph K 1 , k. A partial k‐star design of order n is a pair ( V , A ) where V is a set of n vertices and A is a set of edge‐disjoint k‐stars whose vertex sets are subsets of V. If each edge of the complete graph with vertex set V is in some star in A, then ( V , A ) is a (complete) k‐star design.
Ajani De Vas Gunasekara, Daniel Horsley
wiley +1 more source
A Systematic Overview of Caching Mechanisms to Improve Hadoop Performance
Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.ABSTRACT In today's distributed computing environments, the rapid generation of large‐scale data from diverse sources poses significant challenges in terms of storage, management, and processing, particularly for traditional relational databases. Hadoop has emerged as a widely adopted framework for handling such data through parallel processing across ...
Rana Ghazali, Douglas G. Down
wiley +1 more source
From Structural Analysis to Observer–Based Residual Generation for Fault Detection
International Journal of Applied Mathematics and Computer Science, 2018 This paper combines methods for the structural analysis of bipartite graphs with observer-based residual generation. The analysis of bipartite structure graphs leads to over-determined subsets of equations within a system model, which make it possible to
Pröll Sebastian +2 more
doaj +1 more source
Network‐based bioregionalization of demersal fish in continental shelf seas
Ecography, Volume 2025, Issue 11, November 2025.Biogeographical partitioning of ecological communities has been renewed in recent decades to illustrate broad distributional patterns. In the oceans, observational datasets have grown substantially and open new access to test bioregional patterns beyond classically fixed thresholds of endemism to differentiate regions.
Liam MacNeil, Marco Scotti
wiley +1 more source
‘ILSM': a package to analyze the interconnection structure of tripartite interaction networks
Ecography, Volume 2025, Issue 11, November 2025.In natural or human‐disturbed ecosystems, ecological networks often comprise multiple interaction types, which have been increasingly represented by multipartite ecological networks. One important aspect of their network architecture is how different interaction types or subnetworks are interconnected by connector species, here defined as the ...
Weicheng Sun, Yangyang Zhao, Chuan Yan
wiley +1 more source
Dispersed points and geometric embedding of complete bipartite graphs [PDF]
, 1991 Hiroshi Maehara
openalex +1 more source
Spanning Plane Subgraphs of 1‐Plane Graphs
Journal of Graph Theory, Volume 110, Issue 3, Page 290-297, November 2025.ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi +2 more
wiley +1 more source
Recognizing Trees From Incomplete Decks
Journal of Graph Theory, Volume 110, Issue 3, Page 322-336, November 2025.ABSTRACT Given a graph G, the unlabeled subgraphs G − v are called the cards of G. The deck of G is the multiset { G − v : v ∈ V ( G ) }. Wendy Myrvold showed that a disconnected graph and a connected graph both on n vertices have at most ⌊ n 2 ⌋ + 1 cards in common and found (infinite) families of trees and disconnected forests for which this upper ...
Gabriëlle Zwaneveld
wiley +1 more source
Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth
Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley +1 more source