Results 61 to 70 of about 453 (193)
Structural Concrete, EarlyView.Abstract Compression field approaches such as the Cracked Membrane Model with fixed, interlocked cracks (CMM‐F) are efficient tools for the mechanical modeling of reinforced concrete elements, providing the mechanical model σ=fε$$ \boldsymbol{\upsigma} =f\left(\boldsymbol{\upvarepsilon} \right) $$ required for finite element analyses.
Andreas Näsbom +2 more
wiley +1 more source
Graph Isomorphism Completeness for Chordal bipartite graphs and Strongly Chordal Graphs
, 2004 This paper deals with the graph isomorphism (GI) problem for two graph classes: chordal bipartite graphs and strongly chordal graphs. It is known that GI problem is GI complete even for some special graph classes including regular graphs, bipartite ...
Ryuhei Uehara, et al.
core
Pre‐failure behavior of continuous post‐tensioned and post‐grouted beam in case of tendon failure
Structural Concrete, EarlyView.Abstract Grouted tendons are a common solution for long‐span bridge structures. The grout provides bond and corrosion protection for prestressing steel. However, if the grouting is defective, corrosion of the prestressing steel may initiate and eventually lead to tendon failure.
Olli Asp +2 more
wiley +1 more source
Journal of Animal Ecology, EarlyView.Migrating songbirds regularly use shallow torpor (up to 98% of birds for some species) to save energy (up to 42%) during inactive periods. This Ruby‐crowned Kinglet Corthylio calendula that was captured after a spring snowstorm highlights the value of being able to save energy when encountering unfavourable conditions.
Ryan A. C. Leys +2 more
wiley +1 more source
A Characterization of Strongly Chordal Graphs
, 1996 In this paper, we present a simple characterization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the ...
Elias Dahlhaus +2 more
core
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Computer Graphics Forum, EarlyView.Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ragnar Nevries, Christian Rosenke
openaire +1 more source
On P4-transversals of chordal graphs
, 2008 A P4-transversal of a graph G is a set of vertices T which meet every P4 of G. A P4-transversal T is called stable if there are no edges in the subgraph of G induced by T.
Stacho, Juraj
core +1 more source
Counting independent sets in strongly orderable graphs
, 2021 We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem when G is restricted to the class of strongly orderable graphs, a superclass ...
Müller, H, Heinrich, M
core +1 more source
Establishing Shape Correspondences: A Survey
Computer Graphics Forum, EarlyView.Abstract Shape correspondence between surfaces in 3D is a central problem in geometry processing, concerned with establishing meaningful relations between surfaces. While all correspondence problems share this goal, specific formulations can differ significantly: Downstream applications require certain properties that correspondences must satisfy ...
A. Heuschling, H. Meinhold, L. Kobbelt
wiley +1 more source