Results 321 to 330 of about 1,606,531 (352)
Some of the next articles are maybe not open access.
Computing the partition function for graph homomorphisms
Combinatorica, 2014We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain.
A. Barvinok, P. Soberón
semanticscholar +1 more source
One2Multi Graph Autoencoder for Multi-view Graph Clustering
The Web Conference, 2020Multi-view graph clustering, which seeks a partition of the graph with multiple views that often provide more comprehensive yet complex information, has received considerable attention in recent years.
Shaohua Fan +5 more
semanticscholar +1 more source
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
Nicos Christofides, P. Brooker
openaire +2 more sources
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 +3 more sources
Theory of Computing Systems, 2010
We investigate the unbalanced cut problems. A cut (A,B) is called unbalanced if the size of its smaller side is at most k (called k-size) or exactly k (called Ek-size), where k is an input parameter. We consider two closely related unbalanced cut problems, in which the quality of a cut is measured with respect to the sparsity and the conductance ...
Angsheng Li, Peng Zhang
openaire +2 more sources
We investigate the unbalanced cut problems. A cut (A,B) is called unbalanced if the size of its smaller side is at most k (called k-size) or exactly k (called Ek-size), where k is an input parameter. We consider two closely related unbalanced cut problems, in which the quality of a cut is measured with respect to the sparsity and the conductance ...
Angsheng Li, Peng Zhang
openaire +2 more sources
Algorithms for partitioning a graph
Computers & Industrial Engineering, 1995Abstract The k -way graph partitioning problem is considered with two efficient heuristic procedures. Algorithms “local extreme exchange” (LEE) and “overall extreme exchange” (OEE) are presented by modifying Kernighan-Lin's two way uniform partitioning method. In algorithm LEE, a node which maximizes the reduced cost is selected and exchanged with a
PARK, T, LEE, CY Lee, Chae Young
openaire +2 more sources
2010
Many difficult optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertex set of a given graph into subsets \({V }_{1},\ldots,\!{V }_{k}\) called colour classes ...
openaire +2 more sources
Many difficult optimization problems on graphs become tractable when restricted to some classes of graphs, usually to hereditary classes. A large part of these problems can be expressed in the vertex partitioning formalism, i.e., by partitioning of the vertex set of a given graph into subsets \({V }_{1},\ldots,\!{V }_{k}\) called colour classes ...
openaire +2 more sources
Canadian Mathematical Bulletin, 1968
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +3 more sources
In 1879 Kempe [5] presented what has become the most famous of all incorrect proofs of the Four Colour Conjecture, but even though his proof was erroneous his method has become quite useful. In 1890 Heawood [4] was able to modify Kempe's method to establish the Five Colour Theorem for planar graphs.
openaire +3 more sources
Partitions and domination in a graph
2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hartnell, B. L. +1 more
openaire +2 more sources
On the Testability of Graph Partition Properties
International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2018Yonatan Nakar, D. Ron
semanticscholar +1 more source