Results 261 to 270 of about 35,638 (292)
Some of the next articles are maybe not open access.
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Konstantin Andreev, Harald Racke
openaire +1 more source
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Konstantin Andreev, Harald Racke
openaire +1 more source
Theory of Computing Systems, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Angsheng, Zhang, Peng
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Angsheng, Zhang, Peng
openaire +1 more source
SIAM Journal on Computing, 1992
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Bui, Thang Nguyen, Peck, Andrew
openaire +2 more sources
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Bui, Thang Nguyen, Peck, Andrew
openaire +2 more sources
Combinatorics, Probability and Computing, 1996
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +1 more source
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +1 more source
Local bipartite turán graphs and graph partitioning
Networks, 1994AbstractMotivated by the NP‐hard problem of finding a minimum‐weight balanced bipartition of an edge‐weighted complete graph, we studied the class of graphs having the same degrees as bipartite Turán graphs. In particular, we established a maximal set of linear equations satisfied by the counts of the possible incidences of 3‐ and 4‐cycles on such ...
Lee, Jon, Ryan, Jennifer
openaire +2 more sources
Mathematical Methods of Operations Research (ZOR), 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hager, William W., Krylyuk, Yaroslav
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hager, William W., Krylyuk, Yaroslav
openaire +2 more sources