Results 81 to 90 of about 8,525 (305)
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
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 +3 more
openaire +2 more sources
Colored fermionic vertex models and symmetric functions
, 2023 In this text we introduce and analyze families of symmetric functions arising as partition functions for colored fermionic vertex models associated with the quantized affine Lie superalgebra Uq((1|n)).
Aggarwal, A, Wheeler, M, Borodin, A
core +1 more source
Advanced Materials, EarlyView.Asymmetric localized electron distribution has been optimized in covalent organic frameworks to enhance *O2 adsorption and facilitate charge transfer, boosting photocatalytic two‐electron transfer oxygen reduction toward H2O2 production from water and air.
Qinglan Zhao +12 more
wiley +1 more source
Cubic Graphs with Total Domatic Number at Least Two
Discussiones Mathematicae Graph Theory, 2018 Let G be a graph with no isolated vertex. A total dominating set of G is a set S of vertices of G such that every vertex is adjacent to at least one vertex in S.
Akbari Saieed +3 more
doaj +1 more source
, 2014 technical report microsoft researchBalanced edge partition has emerged as a new approach to partition an input graph data for the purpose of scaling out parallel computations, which is of interest for several modern data analytics computation platforms ...
Vojnovic, Milan +6 more
core +1 more source
Advanced Materials Interfaces, EarlyView.Schematic illustration of a sustainable nanofabrication process: chitosan derived from natural sources is used as a biodegradable thin film resist, patterned via Constant Pulse‐Assisted Force Lithography (CP‐AFL) to create tunable nanogrooves. These grooves template gold nanowire formation, enabling high‐resolution nanopatterning under ambient ...
Paolo Pellegrino +7 more
wiley +1 more source
Partitioning 3-colored complete graphs into three monochromatic cycles
, 2011 We show in this paper that in every 3-coloring of the edges of Kn all but o(n) of its vertices can be partitioned into three monochromatic cycles. From this, using our earlier results, actually it follows that we can partition all the vertices into at
Gyárfás, András +3 more
core
Boosting Vertex-Cut Partitioning for Streaming Graphs
2016 IEEE International Congress on Big Data (BigData Congress), 2016 While the algorithms for streaming graph partitioning are proved promising, they fall short of creating timely partitions when applied on large graphs. For example, it takes 415 seconds for a state-of-the-art partitioner to work on a social network graph with 117 millions edges.
Hooman Peiro Sajjad +4 more
openaire +3 more sources
Advanced Materials Technologies, EarlyView.Laser‐assisted synthesis enables rapid (within 1 h) and high‐yield (≥90%) production of Co‐MOFs with mesoporous structures, tunable magnetic and optical properties, and efficient adsorption of N2, CH4, and CO2 for low‐energy gas separation. DFT calculations elucidate the electronic structure and adsorption behavior.
Saliha Mutlu +10 more
wiley +1 more source