Results 211 to 220 of about 175,549 (222)
Concluding remarks: Atmospheric chemistry in cold environments.
Faraday DiscussAmmann M.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Harald Räcke, Konstantin Andreev
openaire +2 more sources
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
Harald Räcke, Konstantin Andreev
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 +2 more sources
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 +2 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
Discrete Optimization, 2019
Abstract Given an undirected graph, a star partition is a partition of the nodes into subsets with at least two nodes so that the subgraph induced by each subset has a spanning star. Star partitions are related to well-known problems concerning domination in graphs and edge covering.
G. Andreatta +3 more
openaire +1 more source
Abstract Given an undirected graph, a star partition is a partition of the nodes into subsets with at least two nodes so that the subgraph induced by each subset has a spanning star. Star partitions are related to well-known problems concerning domination in graphs and edge covering.
G. Andreatta +3 more
openaire +1 more source
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