Results 71 to 80 of about 453 (193)
The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs [PDF]
, 2012 Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B|=b and |W|=w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to cographs, distance-hereditary graphs, interval graphs and strongly chordal ...
Ton Kloks +3 more
openaire +2 more sources
Strongly chordal and chordal bipartite graphs are sandwich monotone
, 2011 A graph class is sandwich monotone if, for every pair of its graphs G (1)=(V,E (1)) and G (2)=(V,E (2)) with E (1)aS,E (2), there is an ordering e (1),aEuro broken vertical bar,e (k) of the edges in E (2)a-E (1) such that G=(V,E (1)a(a){e (1),aEuro ...
Heggernes, P. +3 more
core
Survey on Visualization of Information Diffusion over Networks
Computer Graphics Forum, EarlyView.Abstract Information Diffusion (ID) describes how a value (e.g., a pathogen, a rumor, a packet) spreads through an underlying “medium” network of elements (e.g., a social or computer network). Understanding the information diffusion process is essential to predicting trends, controlling misinformation, and enhancing decision‐making as well as ...
T. Baumgartl +8 more
wiley +1 more source
Edgewise strongly shellable clutters
, 2018 When [Formula: see text] is a chordal clutter in the sense of Woodroofe or Emtander, we show that the complement clutter is edgewise strongly shellable.
Yi-Huang Shen, Jin Guo, Tongsuo Wu
core +1 more source
Single‐Cell Virtual Perturbation Screening Identifies STAT3 as a Key Regulator of Dentinogenesis
Cell Proliferation, EarlyView.STAT3 promotes odontoblast differentiation in dental mesenchymal cells by transcriptionally regulating WNT2B via the canonical Wnt/β‐catenin signalling pathway. These findings elucidate a mechanism underlying dentine development. ABSTRACT Dentine formation constitutes a physiological process precisely regulated by signal transduction modules governing ...
Yanfei Zhu +12 more
wiley +1 more source
Total-chromatic number and chromatic index of dually chordal graphs
, 2015 Given a graph G and a vertex nu, a vertex u is an element of N(nu) is a maximum neighbor of nu if for all w is an element of N(nu) we have N(zu) subset of or equal to N(u), where N(nu) denotes the neighborhood of nu in G.
de Figueiredo, CMH +2 more
core +1 more source
The Economic History Review, EarlyView.Abstract The 1430s were characterized by extreme weather conditions, food and fodder shortages, and high mortalities among animals and humans, although the severity of events and their consequences in England have received limited attention. The economic downturn and the depressed customary land market in this decade marked the beginning of the Great ...
Mark Bailey
wiley +1 more source
Koszul graded Möbius algebras and strongly chordal graphs
Selecta Mathematica28 pages, to appear in Selecta ...
LaClair, Adam +3 more
openaire +3 more sources
On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs
, 1994 In this paper we study the computational complexity (both sequential and parallel) of the maximum matching problem for chordal and strongly chordal graphs.
Elias Dahlhaus, Marek Karpinski
core
Tree spanners on chordal graphs: complexity and algorithms
, 2004 A tree t-spanner T in a graph G is a spanning tree of G such that the distance in T between every pair of vertices is at most t times their distance in G. The TREE t-SPANNER problem asks whether a graph admits a tree t-spanner, given t.
Le, Hoàng-Oanh +3 more
core +1 more source