Results 81 to 90 of about 295,471 (297)

Capacitated Partition Vertex Cover and Partition Edge Cover

CoRR
Our first focus is the Capacitated Partition Vertex Cover (C-PVC) problem in hypergraphs. In C-PVC, we are given a hypergraph with capacities on its vertices and a partition of the hyperedge set into $ω$ distinct groups. The objective is to select a minimum size subset of vertices that satisfies two main conditions: (1) in each group, the total number ...
Rajni Dabas, Samir Khuller, Emilie Rivkin   +2 more
openaire   +2 more sources

Bioinspired Adaptive Surfaces for Intelligent Liquid Manipulation: Progressing From Passive and Active to Hybrid Strategies

Advanced Materials, EarlyView.
This review examines passive, active, and hybrid liquid manipulation strategies, highlighting hybrid approaches as an emerging route to reconcile energy efficiency with adaptive control. By actively reconstructing passive surfaces to store programmable interfacial energy, hybrid systems enable flexible yet low‐power liquid transport, with perspectives ...
Jiaqi Miao, Yiyuan Zhang, Liqiu Wang, Alan C. H. Tsang   +3 more
wiley   +1 more source

From Fiber Bundles to Architected Membranes: Triply Periodic Minimal Surface Architectures for Biohybrid Artificial Lungs

Advanced Materials, EarlyView.
Additively manufactured triply periodic minimal surface (TPMS) membranes offer an architecture‐driven alternative to hollow fiber bundles in artificial lungs. Multiphysics simulations and endothelialized prototypes show that the 3D‐printable membrane architecture improves gas exchange, blood flow distribution, and hemocompatibility, enabling ...
Michael Pflaum, Kai P. Barbian, Florian Neuhaus, Gerrit Sitarz, Carolin Nölke, Sebastian V. Jansen, John Linkhorst, Lukas T. Hirschwald, Sebastian Brosch, Christian Certa, Ulrich Steinseifer, Matthias Wessling, Jutta Arens, Arjang Ruhparwar, Bettina Wiegmann   +14 more
wiley   +1 more source

Compactified webs and domain wall partition functions

European Physical Journal C: Particles and Fields, 2017
In this paper we use the topological vertex formalism to calculate a generalization of the “domain wall” partition function of M-strings. This generalization allows calculation of partition function of certain compactified webs using a simple gluing ...
Khurram Shabbir
doaj   +1 more source

Approximation algorithms for the partition vertex cover problem

Theoretical Computer Science, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Suman Kalyan Bera, Shalmoli Gupta, Amit Kumar 0001, Sambuddha Roy   +3 more
openaire   +3 more sources

Characterizing partition functions of the vertex model [PDF]

, 2011
We characterize which graph parameters are partition functions of a vertex model over an algebraically closed field of characteristic 0 (in the sense of [P. de la Harpe, V.F.R.
Regts, Guus, Lovász, László, Schrijver, A., Draisma, J. (Jan), Schrijver, A. (Lex), Lovász, L., Gijswijt, D., Draisma, Jan, Regts, G. (Guus), Regts, G., Lovász, L. (László), Dion C. Gijswijt, Alexander Schrijver, Schrijver, Alexander, Guus Regts, Gijswijt, D.C., Gijswijt, Dion C., Gijswijt, D. (Dion), Draisma, J., Jan Draisma, László Lovász   +20 more
core   +1 more source

Tailoring Iron Nanostructures on MoS2: The Pivotal Role of Sulfur Vacancies in Growth Morphology and Charge Transfer

Advanced Materials Interfaces, EarlyView.
The deposition of Iron on pristine MoS2/Au(111) monolayers produces nanoparticles that donate charge to the support, generating Fe+2‐interfacial species. On the contrary, on defect‐engineered MoS2, sulfur vacancies trap sub‐nanometric Fe clusters and host two excess electrons that redistribute locally, suppressing Fe oxidation without formal Mo ...
Marco Nalesso, Naiara Leticia Marana, Eleonora Ascrizzi, Mattia Cattelan, Silvia Nappini, Ilargi Napal Azcona, Igor Píš, Giancarlo Milotti, Elena Magnano, Anna Maria Ferrari, Stefano Agnoli   +10 more
wiley   +1 more source

The upper domatic number of a graph

AKCE International Journal of Graphs and Combinatorics, 2020
Let be a graph. For two disjoint sets of vertices and , set dominates set if every vertex in is adjacent to at least one vertex in . In this paper we introduce the upper domatic number , which equals the maximum order of a vertex partition such that for ...
Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice McRae, Nicholas Phillips   +4 more
doaj   +1 more source

3D Nanorod‐Shaped Binder‐Free Ni1−xFexCo2O4 Anodes Demonstrate High Performance and Stable Operation Under Accelerated Stress Tests in Anion Exchange Membrane Water Electrolysis

Advanced Materials Interfaces, EarlyView.
3D shaping of Ni1‐xFexCo2O4 spinel electrocatalyst to form high aspect ratio nanorods, made of 25 nm grain size particles and directly grown on Nickel felt, is proposed to improve the performance of industrial catalysts based on group‐VIII transition‐metal oxides.
Ataollah Niyati, Ombretta Paladino
wiley   +1 more source

A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4

Discussiones Mathematicae Graph Theory, 2020
In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
doaj   +1 more source