Results 91 to 100 of about 1,207,649 (297)
Bioinspired Bouligand architectures are translated into biodegradable polymer laminates with integrated sensing, revealing how structural design governs multifunctional performance. A 20° interlayer rotation optimizes strength, flexibility, and electromechanical response, while embedded nanotube networks enable real‐time damage detection and wearable ...
Piotr K. Szewczyk +4 more
wiley +1 more source
Faithfulness in chain graphs: The discrete case
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Hierarchical Representation of Discrete Data on Graphs [PDF]
We propose a new hierarchical representation of discrete data sets living on graphs. The approach takes advantage of recent works on graph regularization. The role of the merging criterion that is common to hierarchical representations is greatly reduced due to the regularization step.
Moncef Hidane +2 more
openaire +3 more sources
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances [PDF]
Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of ΩΩ, then we write U≈V if there exists a finite subset F of ΩΩ such that the subsemigroup generated by U and F equals that generated by V and F.
Morayne, Michal +9 more
core +1 more source
Single‐cell and spatially resolved impedance mapping using a high‐density CMOS‐MEA platform enables non‐invasive monitoring of osteoarthritis‐associated chondrocyte dynamics. Continuous label‐free measurements reveal heterogeneous remodeling behaviors, including proliferation, migration, and phenotypic transitions, establishing a powerful approach for ...
Neha Deshpande +9 more
wiley +1 more source
Some Bounds for the Fragmentation Coefficient of Random Graphs
Graph fragmentation aims to find the smallest vertex subset whose removal breaks a graph into components of bounded size. While this problem has applications in network dismantling and combinatorics, theoretical bounds on optimal solutions remain limited.
Katerina Adler, Reuven Cohen, Simi Haber
doaj +1 more source
Finite approximation of stably compact spaces
Finite approximation of spaces by inverse sequences of graphs (in the category of so-called topological graphs) was introduced by Smyth, and developed further.
M.B. Smyth, J. Webster
doaj +1 more source
Discrete evacuation in graphs with multiple exits
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Piotr Borowiecki +3 more
openaire +2 more sources
Asymmetric game perfect graphs and the circular coloring game of weighted graphs [PDF]
Zacharopoulos P. Asymmetric game perfect graphs and the circular coloring game of weighted graphs.
Zacharopoulos, Panagiotis
core

