Results 81 to 90 of about 142,209 (249)
Advanced Functional Materials, EarlyView.Geometric multi‐bit patterning based on dynamic wetting and dewetting phenomena creates roulette‐like Physical Unclonable Function (PUF) labels with stochastic yet deterministic properties. This method leverages the solutal‐Marangoni effect for high randomness while achieving deterministic multinary patterns through polygonal confinement of binary ...
Yeongin Cho +8 more
wiley +1 more source
Towards optimal kernel for connected vertex cover in planar graphs [PDF]
, 2011 We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of ...
Kowalik, Lukasz +2 more
core
Partitioning edge-coloured complete graphs into monochromatic cycles and paths
, 2012 A conjecture of Erd\H{o}s, Gy\'arf\'as, and Pyber says that in any edge-colouring of a complete graph with r colours, it is possible to cover all the vertices with r vertex-disjoint monochromatic cycles. So far, this conjecture has been proven only for r
Alexey Pokrovskiy +10 more
core +1 more source
Engineering a Spin‐Orbit Bandgap in Graphene‐Tellurium Heterostructures
Advanced Functional Materials, EarlyView.Tellurium intercalation in epitaxial graphene on Ir(111) enables the emergence of a spin–orbit‐induced bandgap with energy spin splitting. By combining STM, ARPES, spin‐resolved ARPES, and DFT, two structural phases are identified, both exhibiting tunable electronic doping.
Beatriz Muñiz Cano +14 more
wiley +1 more source
Fine-grained Meta-Theorems for Vertex Integrity [PDF]
Logical Methods in Computer ScienceVertex Integrity is a graph measure which sits squarely between two more well-studied notions, namely vertex cover and tree-depth, and that has recently gained attention as a structural graph parameter.
Michael Lampis, Valia Mitsou
doaj +1 more source
Randomized Composable Coresets for Matching and Vertex Cover
, 2017 A common approach for designing scalable algorithms for massive data sets is to distribute the computation across, say $k$, machines and process the data using limited communication between them.
Assadi, Sepehr, Khanna, Sanjeev
core +1 more source
Advanced Functional Materials, EarlyView.Intelligent radiative cooling devices, adaptable to various weather conditions, have the potential for year‐round energy savings. This study introduces a sustainable dual‐mode film made from polycaprolactone nanofibers and upcycled chip bags for effective thermal management.
Qimeng Song +4 more
wiley +1 more source
A Note on Outer-Independent 2-Rainbow Domination in Graphs
Mathematics, 2022 Let G be a graph with vertex set V(G) and f:V(G)→{∅,{1},{2},{1,2}} be a function. We say that f is an outer-independent 2-rainbow dominating function on G if the following two conditions hold: (i)V∅={x∈V(G):f(x)=∅} is an independent set of G.
Abel Cabrera-Martínez
doaj +1 more source
On the max min vertex cover problem [PDF]
Discrete Applied Mathematics, 2014 We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP -hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an?
Vangelis Th. Paschos +3 more
openaire +5 more sources
Advanced Functional Materials, EarlyView.HKUST‐1/TiO2 composite materials show a very high photocatalytic hydrogen evolution rate which increases as a function of the irradiation time until reaching a plateau and even surpasses the performance of the 1%Pt/TiO2 material after three photocatalytic cycles.
Alisha Khan +9 more
wiley +1 more source