Results 81 to 90 of about 1,986,691 (177)
Global Graph Surrogates and Neural Graph Elements for Computational Mechanics
ABSTRACT Machine learning surrogates are increasingly used to accelerate physics‐based simulations by predicting full‐field responses at a fraction of the computational cost. In this contribution, we present two complementary graph‐based approaches for surrogate modelling in computational mechanics.
Rutwik Gulakala, Marcus Stoffel
wiley +1 more source
Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs
ABSTRACT A (2‐dimensional) realisation of a graph G is a pair ( G , p ), where p maps the vertices of G to R 2. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise. We say that G is rigid if every generic realisation of G is rigid; otherwise, G is flexible. In this paper, we investigate
Katie Clinch +5 more
wiley +1 more source
Chordal Graphs as Intersection Graphs of Pseudosegments
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. The main contribution is a construction which shows that all chordal graphs which have a representation as intersection graph of subpaths on a tree are ...
Felsner, Stefan, Dangelmayr, Cornelia
core +1 more source
Chordal Graphs and Their Relatives: Algorithms and Applications [PDF]
While the problem of generating random graphs has received much attention, the problem of generating graphs for specific classes has not been studied much. In this dissertation, we propose schemes for generating chordal graphs, weakly chordal graphs, and
Rahman, Md Zamilur
core
Weak Degeneracy of Planar Graphs
ABSTRACT The weak degeneracy of a graph G is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d‐degenerate graph is weakly d‐degenerate, but the converse is not true in general (e.g., all connected d‐regular graphs except cycles and cliques
Anton Bernshteyn +2 more
wiley +1 more source
On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs
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
A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley +1 more source
ABSTRACT Purpose To improve the accuracy of diffusion‐weighted powder average signals for diffusion encoding with arbitrary b‐tensors. Methods We identify an intrinsic dihedral (D2) symmetry of diffusion signals for arbitrary diffusion encoding, which defines their natural signal space (a quotient of 3D rotations). Based on this, we propose a method to
Sune Nørhøj Jespersen +1 more
wiley +1 more source
ManyBabies 3: A Multi‐Lab Study of Infant Algebraic Rule Learning
ABSTRACT The ability to learn and apply rules lies at the heart of cognition. In a seminal study, Marcus et al. (1999) reported that 7‐month‐old infants learned abstract rules over syllable sequences and were able to generalize those rules to novel syllable sequences.
Ingmar Visser +83 more
wiley +1 more source
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

