Results 171 to 180 of about 617,805 (269)
Decomposing Berge graphs and detecting balanced skew partitions [PDF]
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
Concurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada +2 more
wiley +1 more source
Ecology and Evolution, Volume 16, Issue 10, October 2026.We present the largest tropical tri‐trophic plant–gall–parasitoid network documented to date, assembled from lowland rainforest in Papua New Guinea. The network reveals strikingly high specialisation, in addition to gall traits such as apparency shaping parasitoid richness.
Philip T. Butterill +5 more
wiley +1 more source
Bipartite friends and strangers walking on bipartite graphs
Discrete Mathematics18 pages, 8 figures, 2 ...
openaire +4 more sources
Engineering Reports, Volume 8, Issue 10, October 2026.An adversarially regularized, carbon‐aware dynamic graph framework enables robust threat detection in evolving social networks by integrating temporal embeddings, community tracking, and sequential threat profiling. The approach achieves ∼95%–96% accuracy while reducing training energy consumption by 40%–45%, supporting scalable real‐world deployment ...
Romil Rawat +5 more
wiley +1 more source
Glia, Volume 74, Issue 10, October 2026.We used CellChat to infer altered cell–cell communication in Alzheimer's disease Microglia signal to each other via SPP1 in Alzheimer's disease. SPP1‐expressing microglia are present around amyloid‐β plaques. ABSTRACT Microglia play a key role in the pathophysiology of Alzheimer's Disease (AD) and their increased heterogeneity likely affects disease ...
Janssen M. Kotah +7 more
wiley +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source
Hitting Times in the Binomial Random Graph
Journal of Graph Theory, Volume 113, Issue 2, Page 377-393, October 2026.ABSTRACT Fix k ≥ 2 , choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n )
wiley +1 more source
Distributed Integrated Scheduling Algorithm for Identical Two-Workshop Based on the Improved Bipartite Graph. [PDF]
Sensors (Basel)Wei Y, Zhou W, Zhao J, Tan Z, Xie Z.
europepmc +1 more source
The study of C4-saturated bipartite graphs
, 2010 碩士如果圖G中不含C4，但再增加一邊之後就會產生C4，則稱圖G是不含C4的飽和圖。圖G為在Km,n中不含C4的飽和子圖，即表示圖G為Km,n的子圖，且為不含C4的飽和圖。在此篇論文中，主要是討論在Km,n中不含C4飽和子圖的可能邊數。我們令S(m,n)＝{t︱存在G為在Km,n中不含C4的飽和子圖，且︱E(G)︱＝t}，利用組合設計中之史坦納三元系及Bryant和Fu論文中判別圖G是否為含有最多邊的不含C4的飽和圖的建構法，而獲得當n足夠大時S(m,n)的最大值，及m≡0,1,2,3(mod 6)時S ...
林泰平; Lin, Tai-ping
core