Results 171 to 180 of about 655,680 (212)
Abstract Cultural entrepreneurship research emphasizes entrepreneurs’ use of cultural resources to influence audience evaluations through resonance. However, the process by which such cultural resonance is achieved remains underexplored, particularly as an intermediary outcome.
Xiumei Li +3 more
wiley +1 more source
Weighted veronese rings via convex semigroups
Abstract We determine several properties of two‐dimensional normal affine semigroup rings, and in particular of weighted Veronese rings, including determinantal presentations, Gröbner bases, graded Hilbert series and graded Betti numbers, the structure of their associated graded rings, and their Koszul property.
Bek Chase +6 more
wiley +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo +3 more
core
Dune Crestline Mapping With Deep Learning Reveals Large‐Scale Dune Patterns in NW China
Abstract Dune crestlines encode sediment transport dynamics and atmospheric forcing, yet their large‐scale quantification has been constrained by labor‐intensive mapping or limited resolution. Here we develop an attention‐augmented U‐Net model to automatically extract crestlines from ∼1 m resolution satellite imagery.
Peng Liang +6 more
wiley +1 more source
On Graph Searches, Chordal and AT-Free Graphs
Chordal and AT-free graphs are two graph families that have numerous applications in biology, operational optimization, computation, and mathematics. Lexicographical breadth-first search and other graph searches has had some surprising applications in ...
Zhan, Irvan
core
Chordal graphs and the characteristic polynomial
A characteristic polynomial was recently defined for greedoids, generalizing the notion for matroids. When chordal graphs are viewed as antimatroids by shelling of simplicial vertices, the greedoid characteristic polynomial gives additional information ...
Jessica A Wolfson +2 more
core
Chordal Probe Graphs (Extended Abstract)
In this paper, we introduce the class of chordal probe graphs which are a generalization of both interval probe graphs and chordal graphs. A graph G is chordal probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N ...
Martin Charles +2 more
core
Graph searching on chordal graphs
Two variations of the graph searching problem, edge searching and node searching, are studied on several classes of chordal graphs, which include split graphs, interval graphs and k-starlike graphs.
Sheng-Lung Peng +4 more
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Dominating Sets in Chordal Graphs
SIAM Journal on Computing, 1982A set of vertices D is a dominating set for a graph if every vertex is either in D or adjacent to a vertex which is in D. We show that the problem of finding a minimum dominating set in a chordal graph is NP-complete, even when restricted to undirected path graphs, but exhibit a linear time greedy algorithm for the problem further restricted to ...
Kellogg S. Booth
exaly +4 more sources

