"Balanced graph edge partition". In: Proceedings of the 20th ACM SIGKDD international confer- ence on Knowledge discovery and data mining. ACM. 2014, pp. 1456-1465 (cit. on pp. 8, 97).Florian Bourse, Marc Lelarge, and ...
Graph partitioning drives graph processing in distributed, disk-based and NUMA-aware systems. A commonly used partitioning goal is to balance the number of edges per partition in conjunction with minimizing the edge or vertex cut. While this type of partitioning is computationally expensive, we obser...
Find a pair of edge-disjoint spanning trees such that the maximum weight of these two trees is as small as possible. In the case when G is precisely the union of two trees this problem may be seen as a generalization of the partition problem in which we have added a graph structure to...
Besides balance, there are alternative generalizations of bipartite graphs. A hypergraph is called bipartite if its vertex set V can be partitioned into two sets, X and Y, such that each hyperedge contains exactly one element of X (see bipartite hypergraph). Obviously every bipartite graph is ...
A green balanced scorecard allows businesses to monitor their environmental progress and energy use, as well as quantify their achievements toward decreasing their ecological footprint. The scope of the current research is twofold: (i) to highlight the n
Given a graph G, a G-decomposition of the complete graph Kv is a set of graphs, all isomorphic to G, whose edge sets partition the edge set of Kv. A G-decomposition of Kv is also called a G-design and the graphs of the partition are said to be the blocks. A G-design is said...
2. The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained. 得到了扇和完全等二部图联图的边色数。更多例句>> 2) complete regular bipartite graph 完全等部二分图 1. In this paper,it is proved that the iterated line g raphsof complete regular ...
Sparsebalanced partitions subgraphproblems Noga Alon anielMarx November14, 2010 Abstract We consider maximumdegree almostequal sizes edgebetween Weshow adjacentpairs questionsabout certaingraph embeddings, which have been used constraintsatisfaction problems. werandomly partition largegraph smallnumber roughly...
We shall also determine f(G) when G is a complete multipartite graph, and when G is a generalized 0-graph (i.e., a graph which is a subdivision of a multiple edge). Some applications will also be discussed. Further results about the balanced decomposition number also appear in two ...
We consider graphs without loops or parallel edges in which every edge is assigned + or . Such a signed graph is balanced if its vertex set can be partitioned into parts V1 and V2such that all...Robert CrowstonRoyal Holloway, University of LondonGregory Gutin...