Results 61 to 70 of about 142,209 (249)

Retrotransposon Expression Is Upregulated in Adulthood and Suppressed during Regeneration of the Limb in the Axolotl (Ambystoma mexicanum)

Advanced Biology, EarlyView.
The axolotl's remarkable regenerative abilities decline with age, the causes may include the numerous repetitive elements within its genome. This study uncovers how Ty3 retrotransposons and coexpression networks involving muscle and immune pathways respond to aging and regeneration, suggesting that transposons respond to physiological shifts and may ...
Samuel Ruiz‐Pérez, Nicolás Alcaraz, Karla Torres‐Arciga, José Antonio Ocampo‐Cervantes, Alejandra Cervera, Clementina Castro‐Hernández, Cynthia Gabriela Sámano‐Salazar, Ernesto Soto‐Reyes, Rodrigo González‐Barrios   +8 more
wiley   +1 more source

Bistable Mechanisms 3D Printing for Mechanically Programmable Vibration Control

Advanced Engineering Materials, EarlyView.
This work introduces a 3D‐printed bistable mechanism integrated into tuned mass dampers (TMDs) for mechanically adaptive passive vibration suppression. Through optimized geometry, the bistable design provides adaptable vibration reduction across a broad range of scenarios, achieving effective vibration mitigation without complex controls or external ...
Ali Zolfagharian, Frédéric Demoly, Mohammad Lakhi, Bernard Rolfe, Mahdi Bodaghi   +4 more
wiley   +1 more source

An Exact Algorithm for Minimum Vertex Cover Problem

Mathematics, 2019
In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang, Shuli Hu, Mingyang Li, Junping Zhou   +3 more
doaj   +1 more source

Simultaneously dominating all spanning trees of a graph

Electronic Journal of Graph Theory and Applications, 2022
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann, Sven O. Krumke, Manuel Streicher   +2 more
doaj   +1 more source

Properties of vertex cover obstructions

Discrete Mathematics, 2007
AbstractWe study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it the set of obstructions. Our main result is to give a tight vertex bound of O(k-VERTEX COVER), and then confirm a conjecture made by Liu Xiong that there is a unique ...
Rongwei Lai, Michael J. Dinneen
openaire   +2 more sources

Harnessing Outer Space for Improved Electrocaloric Cooling

Advanced Functional Materials, EarlyView.
A novel radiative heat sink/source‐integrated electrocaloric (R‐iEC) system combines the electrocaloric (EC) effect with a thermally conductive radiative cooler (TCRC) to address heat dissipation limitations in EC devices. Utilizing outer space as a heat sink, the system achieves up to 240 W m−2 of heat dissipation performance, making it highly ...
Dong Hyun Seo, Hyung Rae Kim, Joo Ho Yun, Hyunkyu Kwak, Do Hyeon Kim, Se‐Yeon Heo, Rujun Ma, Gil Ju Lee, Young Min Song   +8 more
wiley   +1 more source

Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints

Algorithms
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs.
Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui, Hirotaka Ono   +4 more
doaj   +1 more source

Self-Stabilizing Capacitated Vertex Cover Algorithms for Internet-of-Things-Enabled Wireless Sensor Networks

Sensors, 2022
Wireless sensor networks (WSNs) achieving environmental sensing are fundamental communication layer technologies in the Internet of Things. Battery-powered sensor nodes may face many problems, such as battery drain and software problems.
Yasin Yigit, Orhan Dagdeviren, Moharram Challenger   +2 more
doaj   +1 more source

Cover pebbling numbers and bounds for certain families of graphs [PDF]

, 2004
Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex.
Watson, Nathaniel G., Yerger, Carl R.
core   +1 more source

TREEWIDTH and PATHWIDTH parameterized by vertex cover

, 2013
After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover.
Chapelle, Mathieu, Liedloff, Mathieu, Todinca, Ioan, Villanger, Yngve   +3 more
core   +3 more sources