Results 11 to 20 of about 3,844 (297)
A social network graph partitioning algorithm based on double deep Q-Network [PDF]
Scientific ReportsWith the rapid expansion of social networks, efficiently mining and analyzing massive graph data has become a fundamental challenge in social network research. Graph partitioning plays a pivotal role in enhancing the performance of such analyses. However,
Jie Cao +4 more
doaj +2 more sources
On the activities and partitions of the vertex subsets of graphs [PDF]
Enumerative Combinatorics and Applications, 2021 Crapo introduced a construction of interval partitions of the Boolean lattice for sets equipped with matroid structure. This construction, in the context of graphic matroids, is related to the notion of edge activities introduced by Tutte. This implies that each spanning subgraph of a connected graph can be constructed from edges of exactly one ...
Kristina Dedndreaj, Peter Tittmann
doaj +4 more sources
Vertex Set Partitions Preserving Conservativeness
Journal of Combinatorial Theory, Series B, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexander A. Ageev +1 more
openaire +2 more sources
Vertex partitions of chordal graphs [PDF]
Journal of Graph Theory, 2006 AbstractA k‐tree is a chordal graph with no (k + 2)‐clique. An ℓ‐tree‐partition of a graph G is a vertex partition of G into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge).
David R Wood
exaly +3 more sources
Branch and bound with simplicial partitions for global optimization
Mathematical Modelling and Analysis, 2008 Branch and bound methods for global optimization are considered in this paper. Advantages and disadvantages of simplicial partitions for branch and bound are shown.
Julius Žilinskas
doaj +3 more sources
Vertex colouring edge partitions
Journal of Combinatorial Theory Series B, 2005 Suppose that the edges of a graph are assigned labels from a \(k\)-set, or equivilently, the edges are partitioned into \(k\) parts. Each vertex \(v\) has an associated multiset \(X_v\) consisting of the labels on its incident edges. The partition is a (proper) vertex coloring if for every edge \(uv\), \(X_u \neq X_v\).
R E L Aldred
exaly +3 more sources
Distributed Vertex-Cut Partitioning [PDF]
, 2014 Graph processing has become an integral part of big data analytics. With the ever increasing size of the graphs, one needs to partition them into smaller clusters, which can be managed and processed more easily on multiple machines in a distributed fashion. While there exist numerous solutions for edge-cut partitioning of graphs, very little effort has
Fatemeh Rahimian +3 more
openaire +3 more sources
European Physical Journal C: Particles and FieldsThis paper is concerned with the investigation of UC and BUC plane partitions based upon the fermion calculus approach. We construct generalized the vertex operators in terms of free charged fermions and neutral fermions and present the interlacing ...
Shengyu Zhang, Zhaowen Yan
doaj +2 more sources
On Vertex Partitions of Hypercubes by Isometric Trees [PDF]
SIAM Journal on Discrete Mathematics, 2011 When $n=2^m-1$ M.Ramras proved, by a counting argument, that for any isometrically embedded tree $T$ on $n$ edges in $Q_n$ there exists a group of translations $G$ such that $\left\{g(T); g\in G \right\}$ is a vertex partition of $Q_n$. Considering a more general context we are able to give an explicit construction of $G$ and can construct non group ...
Mollard, Michel
openaire +3 more sources
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions
Theory and Applications of GraphsGiven a finite, simple graph G, the k-component order connectivity (resp. edge connectivity) of G is the minimum number of vertices (resp. edges) whose removal results in a subgraph in which every component has an order of at most k − 1.
Michael R. Yatauro
doaj +3 more sources