Results 61 to 70 of about 55,028 (193)
New proofs for strongly chordal graphs and chordal bipartite graphs
, 2004 We give new proofs of well-known characterizations of strongly chordal graphs and chordal bipartite graphs. The key ingredient is the dual hypertree structure for totally balanced hypergraphs.
Jacent Tokaz +2 more
core
Regular vines with strongly chordal pattern of (conditional) independence
, 2022 Multivariate statistical models can be simplified by assuming that a pattern of conditional independence is presented in the given data. A popular way of capturing the (conditional) independence is to use probabilistic graphical models.
Zhu, K. (author) +3 more
core +1 more source
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
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
Hamiltonian circuits in chordal bipartite graphs
, 1996 The main result of this paper is the NP-completeness of the HAMILTONIAN CIRCUIT problem for chordal bipartite graphs. This is proved by a sophisticated reduction from SATISFIABILITY. As a corollary, HAMILTONIAN CIRCUIT is NP-complete for strongly chordal
Müller, Haiko
core +1 more source
On P 4 -transversals of Chordal Graphs [PDF]
, 2020 A P 4 -transversal of a graph G is a set of vertices T which meets every P 4 of G. A P 4 -transversal T is called stable if there are no edges in the subgraph of G induced by T .
Juraj Stacho
core
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
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
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
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