Results 51 to 60 of about 129,100 (297)
Recoloring bounded treewidth graphs [PDF]
Let $k$ be an integer. Two vertex $k$-colorings of a graph are \emph{adjacent} if they differ on exactly one vertex. A graph is \emph{$k$-mixing} if any proper $k$-coloring can be transformed into any other through a sequence of adjacent proper $k ...
Bonamy, Marthe, Bousquet, Nicolas
core +2 more sources
Interference Graph Based Channel Assignment Algorithm for D2D Cellular Networks
Device-to-device (D2D) communications underlying cellular networks are a novel approach for providing IoT services, in which D2D communication links and cellular communication links share the same channels.
Liqun Zhao +2 more
doaj +1 more source
A Fast and Scalable Graph Coloring Algorithm for Multi-core and Many-core Architectures
Irregular computations on unstructured data are an important class of problems for parallel programming. Graph coloring is often an important preprocessing step, e.g. as a way to perform dependency analysis for safe parallel execution. The total run time
D Chakrabarti +5 more
core +1 more source
Discovery and Targeted Proteomic Studies Reveal Striatal Markers Validated for Huntington's Disease
ABSTRACT Objective Clinical trials for Huntington's disease (HD) enrolling persons before clinical motor diagnosis (CMD) lack validated biomarkers. This study aimed to conduct an unbiased discovery analysis and a targeted examination of proteomic biomarkers scrutinized by clinical validation. Methods Cerebrospinal fluid was obtained from PREDICT‐HD and
Daniel Chelsky +8 more
wiley +1 more source
Positive‐Tone Nanolithography of Antimony Trisulfide with Femtosecond Laser Wet‐Etching
A butyldithiocarbamic acid (BDCA) etchant is used to fabricate various micro‐ and nanoscale structures on amorphous antimony trisulfide (a‐Sb2S3) thin film via femtosecond laser etching. Numerical analysis and experimental results elucidate the patterning mechanism on gold (reflective) and quartz (transmissive) substrates.
Abhrodeep Dey +12 more
wiley +1 more source
PCI Planning Based on Binary Quadratic Programming in LTE/LTE-A Networks
In recent years, interference has played an increasingly significant part in bulkier and denser Long Term Evolution (LTE/LTE-Advanced) networks. Though intra-cell interference is successfully improved by Orthogonal Frequency Division Multiple Access ...
Jihong Gui, Zhipeng Jiang, Suixiang Gao
doaj +1 more source
Approximation Algorithms for Partially Colorable Graphs [PDF]
Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For alpha = alpha |V| such that the graph induced on S is k-colorable.
Ghoshal, Suprovat +2 more
core +2 more sources
A multivalent antiviral platform based on honeycomb‐shaped DNA nanostructures (HC–Urumin) is developed to enhance the potency and breadth of the host defense peptide Urumin. Through spatially patterned trimeric presentation, HC–Urumin disrupts influenza A virus entry, improves cell viability, and reduces disease severity in vivo‐offering a modular and ...
Saurabh Umrao +11 more
wiley +1 more source
The graph coloring problem involves coloring the nodes of a graph using the minimum number of colors such that no two adjacent nodes share the same color.
Selman Yakut
doaj +1 more source
Inspired by octopuses, actuating legs based on soft materials are fabricated with programmed chiroptical properties and mechanical behaviors to achieve dynamic color modulation and reversible shape morphing, and these legs are developed into a modular OCTOID system.
Seung Hui Han +8 more
wiley +1 more source

