Results 271 to 280 of about 36,227 (305)
Some of the next articles are maybe not open access.
Theory of Computing Systems, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angsheng Li, Peng Zhang 0008
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angsheng Li, Peng Zhang 0008
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 ...
Thang Nguyen Bui, Andrew Peck
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 ...
Thang Nguyen Bui, Andrew Peck
openaire +2 more sources
Combinatorica, 2007
Complete partitions of a graph are vertex partitions such that any two classes are related by an arc. The authors compute tight lower and upper bounds for the maximum number of classes in a complete partition. A technique used is that of finding the largest integer \(\beta(G)\) such that there exists a subgraph \(H\subseteq G\) with maximum degree at ...
Magnús M. Halldórsson +3 more
openaire +1 more source
Complete partitions of a graph are vertex partitions such that any two classes are related by an arc. The authors compute tight lower and upper bounds for the maximum number of classes in a complete partition. A technique used is that of finding the largest integer \(\beta(G)\) such that there exists a subgraph \(H\subseteq G\) with maximum degree at ...
Magnús M. Halldórsson +3 more
openaire +1 more source
Mathematical Methods of Operations Research (ZOR), 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William W. Hager, Yaroslav Krylyuk
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William W. Hager, Yaroslav Krylyuk
openaire +2 more sources
On judicious partitions of graphs
Journal of Combinatorial Optimization, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Muhuo Liu, Baogang Xu
openaire +1 more source
On Partitioning Program Graphs
IEEE Transactions on Software Engineering, 1977In recent years, applications of graph theory to computer software have given fruitful results and attracted more and more attention. A program graph is a graph structural model of a program exhibiting the flow relation or connection among the elements (statements) in the program.
openaire +2 more sources
Parallelism in graph-partitioning
Journal of Parallel and Distributed Computing, 1991Abstract Graph partitioning is an important NP-complete problem with applications in VLSI CAD, processor allocation, and many other areas. The problem is to partition vertices of a graph into two equal-sized sets so that the number of edges joining the sets is minimum.
John E. Savage, Markus G. Wloka
openaire +1 more source
Hierarchical graph partitioning
Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures, 2014One of the important optimization questions in highly parallel systems is the problem of assigning computational resources to communicating tasks. While scheduling tasks/operators, tasks assigned to nearby resources (e.g. on the same CPU core) have low communication costs, whereas tasks assigned to distant resources (e.g.
Mohammad Taghi Hajiaghayi +3 more
openaire +1 more source
Journal of Graph Theory, 1997
Packing by induced stars is characterised.
Yoshimi Egawa +2 more
openaire +2 more sources
Packing by induced stars is characterised.
Yoshimi Egawa +2 more
openaire +2 more sources
The Optimal Partitioning of Graphs
SIAM Journal on Applied Mathematics, 1976The problem considered in this paper is that of partitioning a link-weighted graph G into two parts, each of which is constrained in size by the (given) maximum number of vertices that the part can contain. This is a special case of the general partitioning problem of a graph into k parts with size constraints, which appears in a number of very diverse
Christofides, Nicos, Brooker, P.
openaire +1 more source