Results 101 to 110 of about 27,053 (309)
On the approximability of the maximum induced matching problem [PDF]
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele +12 more
core +1 more source
Uniquely identifying the vertices of pendant-free tricyclic graphs
Planar interconnection networks are essential in VLSI circuit design because they provide efficient layouts that minimize wire use, reduce manufacturing costs, and prevent wire crossings.
Hariharan S, Mohana N
doaj +1 more source
An intrinsic photoactive star‐shaped zinc phtalocyanine‐poly(L‐glutamic acid) (ZnPc‐PGA) nanoplatform for multimodal glioblastoma (GBM) therapy and brain‐targeted elivery. A ZnPc‐PGA‐based multifunctional theranostic nanocarrier platform enables image‐guided, multimodal GBM therapy. ZnPc‐PGA nanocarriers support the integration of fluorescence imaging,
Amina Benaicha‐Fernández +14 more
wiley +1 more source
ABSTRACT Traditional wearable exoskeletons rely on rigid structures, which limit comfort, flexibility, and everyday usability. This work introduces the fundamental technologies to create the first soft, lightweight, intelligent textile‐based exoskeletons (Texoskeletons) built using 1D sensors and actuators.
Amy Lukomiak +19 more
wiley +1 more source
On the planarity of jump graphs
Let \(G\) be a graph of size \(m\geq 1\) and let \(F\) and \(H\) be edge-induced subgraphs of \(G\) of size \(k\) with \(1\leq k\leq m\). In the literature is then defined the \(k\)-jump distance from \(F\) to \(H\). For a graph \(G\) of size \(m\geq 1\) and an integer \(k\) with \(1\leq k\leq m\), the \(k\)-jump graph \(J_k(G)\) is defined as a graph ...
Héctor Hevia +2 more
openaire +1 more source
This paper presents a digital microfluidics‐based technique for transferring and reconfiguring soft nanomembranes. Laser‐machined nanothin membranes are picked up, transported, and aligned via tailored surface tension and the actuation of water droplets, enabling the development of flexible electronics, the integration of functional materials on 3D ...
Quang Anh Nguyen +15 more
wiley +1 more source
WORM Colorings of Planar Graphs
Given three planar graphs F,H, and G, an (F,H)-WORM coloring of G is a vertex coloring such that no subgraph isomorphic to F is rainbow and no subgraph isomorphic to H is monochromatic. If G has at least one (F,H)-WORM coloring, then W−F,H(G) denotes the
Czap J., Jendrol’ S., Valiska J.
doaj +1 more source
A Linear-Time Algorithm for 4-Coloring Some Classes of Planar Graphs. [PDF]
Liang Z, Wei H.
europepmc +1 more source
Field‐free spin‐orbit torque domain‐wall synapses integrated with stochastic MTJ neurons enable compact hardware Boltzmann machines. Leveraging intrinsic stochasticity and multi‐level conductance, the system achieves efficient probabilistic learning with high accuracy, demonstrating a scalable spintronic platform for energy‐efficient edge AI.
Aijaz H. Lone +8 more
wiley +1 more source
Crossing Layout in Non-planar Graph Drawings
Edge crossings are a major obstruction for the readability of graph layouts as has been shown in several empirical studies. Yet, non-planar graphs are abundant in network visualization applications.
Martin Nöllenburg, Nöllenburg, Martin
core +1 more source

