Results 11 to 20 of about 3,864 (298)
Vertex Set Partitions Preserving Conservativeness [PDF]
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
Branch and bound with simplicial partitions for global optimization [PDF]
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
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 +4 more sources
UC and BUC plane partitions [PDF]
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 +4 more sources
Component Order Edge Connectivity, Vertex Degrees, and Integer Partitions [PDF]
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
Cutwidth Bounds via Vertex Partitions [PDF]
CoRR14 pages including appendix.
Antoine Amarilli, Benoît Groz
core +5 more sources
Distance Domination in Vertex Partitioned Graphs
Mathematica Pannonica, 2022 We treat a variation of graph domination which involves a partition (V 1, V 2,..., Vk) of the vertex set of a graph G and domination of each partition class V i over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables ...
Frendrup, Allan +2 more
openaire +2 more sources
AKCE International Journal of Graphs and Combinatorics, 2016 Let G be a graph with chromatic number χ(G) and consider a partition P of G into connected subgraphs. P is a puzzle on G if there is a unique vertex coloring of G using 1, 2, …, χ(G) such that the sums of the numbers assigned to the partition pieces are ...
Daphne Gold +10 more
doaj +1 more source
Vertex sparsifiers : new results from old techniques [PDF]
, 2014 Given a capacitated graph $G = (V,E)$ and a set of terminals $K \subseteq V$, how should we produce a graph $H$ only on the terminals $K$ so that every (multicommodity) flow between the terminals in $G$ could be supported in $H$ with low congestion, and ...
Gupta, Anupam +10 more
core +1 more source