Results 91 to 100 of about 3,864 (298)
Standard Framework for Comparison of Graph Partitioning Techniques
JISR on Computing, 2015 Graph Partitioning is used to distribute graph partitions across nodes for processing. It is very important in the pre-processing step for distributed graph processing.
Mudasser Iqbal, Saif-ur-Rahman
doaj +1 more source
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
Hybrid Amyloid–Boron Nitride Aerogels for Lightweight Sound Insulation
Advanced Materials, EarlyView.Amyloid fibrils template the mild formation of boron nitride–rich hybrid aerogels with hierarchical porosity, enhanced BN‐like ordering, and fibril‐reinforced mechanics. These ultralight materials combine thermal stability with strong sound absorption and transmission loss, offering a sustainable bio‐assisted route toward lightweight acoustic shields ...
Mohammad Peydayesh +8 more
wiley +1 more source
Counting list matrix partitions of graphs [PDF]
, 2013 Given a symmetric D × D matrix M over {0, 1, ∗}, a list M-partition of a graph G is a partition of the vertices of G into D parts which are associated with the rows of M. The part of each vertex is chosen from a given list in such a way that no edge of G
Leslie Ann Goldberg +9 more
core +2 more sources
Plane partition realization of (web of) W $$ \mathcal{W} $$ -algebra minimal models
Journal of High Energy Physics, 2019 Recently, Gaiotto and Rapčák (GR) proposed a new family of the vertex operator algebra (VOA) as the symmetry appearing at an intersection of five-branes to which they refer as Y algebra.
Koichi Harada, Yutaka Matsuo
doaj +1 more source
Photo‐ and Thermally‐Induced Huge Layer Decoupling in Twisted Bilayer WSe2
Advanced Materials, EarlyView.A newly developed automated dark‐field tomography visualizes twist‐angle‐dependent structural relaxation and quantifies 3D structures in twisted bilayer WSe2. This approach reveals the evolution of local stacking configurations, thermally induced sub‐ångström interlayer decoupling, and light‐driven interlayer expansion on picosecond timescales ...
A. Nakamura +10 more
wiley +1 more source
Conditional resolvability in graphs: a survey
International Journal of Mathematics and Mathematical Sciences, 2004 For an ordered set W={w1,w2,…,wk} of vertices and a vertex v in a connected graph G, the code of v with respect to W is the k-vector cW(v)=(d(v,w1),d(v,w2),…,d(v,wk)), where d(x,y) represents the distance between the vertices x and y.
Varaporn Saenpholphat, Ping Zhang
doaj +1 more source
, 2011 We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lovász, Catlin, Kostochka and Rabern.
openaire +2 more sources
Advanced Materials, EarlyView.Hydration‐induced symmetry breaking transforms layered LiInP2S6${\rm LiInP}_2{\rm S}_6$ from a nonpolar to a chiral‐polar phase, producing a giant enhancement of non‐resonant second‐harmonic generation. The reversible tuning of polar order through molecular intercalation establishes a strategy for dynamically controlling nonlinear optical ...
Jadupati Nag +8 more
wiley +1 more source
Max k-cut and judicious k-partitions [PDF]
, 2010 Alon, et al. (2003) [1] proved that every graph with a large cut has a bipartition in which each vertex class contains correspondingly few edges. We prove an analogous result for partitions into k≥3 classes; along the way we prove a result for biased ...
Béla Bollobás +5 more
core +1 more source