Results 151 to 160 of about 20,159 (298)

NodeTrix Planarity Testing with Small Clusters

open access: yes, 2019
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant k. We consider both the case when the sides of the matrices to which the edges are incident are fixed and the case ...
Patrignani M.   +4 more
core   +1 more source

Transfer Printing and Reconfiguration of Soft Electronics Using Digital Microfluidics and Laser Machining

open access: yesAdvanced Functional Materials, EarlyView.
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

An Analysis of Planarity in Face-Routing [PDF]

open access: yes, 2010
In this report we investigate the limits of routing according to left- or right-hand rule (LHR). Using LHR, a node upon receipt of a message will forward to the neighbour that sits next in counter-clockwise order in the network graph.
Cairns, David   +2 more
core  

Orbital Geometry‐Governed Response of Pressure‐Tunable Quantum Defects in hBN

open access: yesAdvanced Functional Materials, EarlyView.
Defects in hBN act as ultrasensitive quantum manometers when the energy of the intradefect optical transitions is modified by lattice compression. The orbital geometry of the electron wave functions governs how electron hopping and Coulomb interactions react uniquely to the reduction of the van der Waals gap and in‐plane compression, leading to robust ...
Magdalena Grzeszczyk   +6 more
wiley   +1 more source

Coloring mixed hypergraphs: from combinatorics to philosophy

open access: yesLe Matematiche, 2004
We survey recent results and open problems on the chromatic spectrum,planarity and colorability of mixed hypergraphs and their relations to suchcategories of philosophy as identity and difference.
Vitaly Voloshin
doaj  

NodeTrix planarity testing with small clusters

open access: yes, 2017
We study the NodeTrix planarity testing problem for flat clustered graphs when the maximum size of each cluster is bounded by a constant k. We consider both the case when the sides of the matrices to which the edges are incident are fixed and the case ...
Patrignani, Maurizio   +7 more
core   +1 more source

Tuning Separator Chemistry: Improving Zn Anode Compatibility via Functionalized Chitin Nanofibers

open access: yesAdvanced Functional Materials, EarlyView.
Nanochitin derived from waste shrimp shells is used to fabricate separators for aqueous zinc batteries. By tuning the density of amine and carboxylic surface groups, water mobility at the separator interface is controlled, promoting uniform zinc deposition, suppressing dendrite growth, and enabling exceptional cycling stability exceeding 2000 h ...
Ibrahim Al Kathemi   +6 more
wiley   +1 more source

On planar mixed hypergraphs

open access: yesComput. Sci. J. Moldova, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
LI MARZI, Enzo, MARINO, Maria Corinna
openaire   +4 more sources

Resolving the Cu(bdc) Conundrum: Identifying Non‐Porous Packing of Prototypical Coordination‐Network Thin Films Combining Advanced Diffraction Techniques and Computational Modelling

open access: yesAdvanced Functional Materials, EarlyView.
Solution‐processed Cu(bdc) forms prototypical MOF thin films for which a multitude of not fully satisfactory structural models have been suggested. Combining rotating grazing‐incidence diffraction and X‐ray reflectivity on two complementary samples with density‐functional theory, we first discard the previously suggested models and then identify a non ...
Narges Taghizade   +7 more
wiley   +1 more source

A planarity test via construction sequences

open access: yes, 2013
Linear-time algorithms for testing the planarity of a graph are well known for over 35 years. However, these algorithms are quite involved and recent publications still try to give simpler linear-time tests.
Schmidt, Jens M.
core  

Home - About - Disclaimer - Privacy