[PDF] Top 20 Complexity of the satisfactory partition problem
Has 10000 "Complexity of the satisfactory partition problem" found on our website. Below are the top 20 most common "Complexity of the satisfactory partition problem".
Complexity of the satisfactory partition problem
... Keywords: Satisfactory partition, graph, complexity, polynomial algorithm, ...GK00] the problem of deciding if a given graph has a vertex partition into two nonempty parts ... Voir le document complet
13
Complexity Dichotomies for the Minimum F-Overlay Problem
... regarding the polynomial vs. NP-hard status with respect to the considered family ...that the easy cases one can think of (e.g. when edgeless graphs of the right sizes are in F, ... Voir le document complet
20
Complexity Dichotomies for the Minimum $F$-Overlay Problem
... on the exact (unknown) number of ...regarding the polynomial vs. NP- hard status with respect to the considered family F ...that the easy cases one can think of ...are the ... Voir le document complet
13
A complexity problem for Borel graphs
... prove the complexity result we isolate a general theorem about the complexity of certain families of ... of subsets of a Polish space X coming from a map that ... Voir le document complet
25
On the existence and determination of satisfactory partitions in a graph
... [3] the problem of deciding if a given graph has a vertex partition into two nonempty sets such that each vertex has at least as many neighbors in its set as in the ...other. The ... Voir le document complet
10
The Shortcut Problem - Complexity and Algorithms
... ILP-Formulation. The number of variables and constraints of the following integer linear program (LSP) is cubic in |V ...|. The model exhibits two types of ...if the ... Voir le document complet
30
The maximum saving partition problem
... notation: The input to the maximum saving partition prob- lem consists of the family S of feasible subsets of V = {1, ...and the sub-additive function f . ... Voir le document complet
10
An exact algorithm for the Partition Coloring Problem
... select the vertex with smallest {external, color} ...R9.) The scores of the destroy and repair heuristics are updated at each iteration as follows: if a method produced a new best solution, ... Voir le document complet
25
Improved worst-case complexity for the MIN 3-SET COVERING problem
... [3] J. Chen, L Liu, and W. Jia. Improvement on vertex cover for low-degree graphs. Networks, 35:253–259, 2000. [4] F. Della Croce and V. Th. Paschos. Computing optimal solutions for the min 3-set cover- ing ... Voir le document complet
7
An exact algorithm for the Partition Coloring Problem
... select the vertex with smallest {external, color} ...R9.) The scores of the destroy and repair heuristics are updated at each iteration as follows: if a method produced a new best solution, ... Voir le document complet
27
Complexity and approximation of satisfactory partition problems
... maximization problem A if for any instance x of the problem it returns a solution y such that val(x, y) ≥ opt A (x) ρ(|x|) ...maximization problem is constant approximable if, for some ... Voir le document complet
10
Complexity Study for the Robust Stable Marriage Problem
... case of SAT that takes additional ...by the specific family F defined ...on the input of the problem. The intuition behind imposing these rules and conditions is to ... Voir le document complet
37
An Integral Equation Formulation of the $N$-Body Dielectric Spheres Problem. Part II: Complexity Analysis
... 3. The error tolerance was set to 10 −8 . We observe that the number of iterations remains constant in the case E = 1 but increases in the case E = 10 −4 , which supports our ...for ... Voir le document complet
30
The complexity of the Unit Stop Number Problem and its implications to other related problems
... 2. The U-SNP is NP-Hard even when restricted to the case where C = 2k, for any k ∈ Z + , and G is a planar bipartite ...proof of Theorem 1 relies on the ability to enforce that no more than 2C ... Voir le document complet
26
The Core-Partition of Hedonic Games
... for the existence of core-partition in hedonic games. In the literature, authors have alternatively offered sufficient conditions for existence by specifying restrictions on feasible ... Voir le document complet
11
The multi-terminal vertex separator problem : Complexity, Polyhedra and Algorithms
... and the terminal-pair-separator formulations use y variables, several valid inequalities presented in Chapter 2 can then be ...efficiently the multi- terminal vertex separator problem. We use two ... Voir le document complet
232
The core-partition of hedonic games
... Journal of Economic Literature Classification Numbers: C71. Keywords: hedonic game, group formation, core-partition, balancedness. R´ esum´ e La classe des jeux h´ edonistiques purs mod´ elisent des ... Voir le document complet
12
On the parity of generalized partition functions, III
... [9] F. Ben Saïd, H. Lahouar and J.-L. Nicolas, On the counting function of the sets of parts such that the partition function takes even values for n large enough. Discrete ... Voir le document complet
29
On the symmetry of the partition function of some square ice models
... column: the non-zero entries alternate in sign, and their sum is equal to ...in the so-called Razumov-Stroganov conjecture related to the O(1) loop model (7; 8; ...between the ASM’s and ... Voir le document complet
9
The core of voting games: a partition approach
... games; Partition approach; ...class of cooperative games in which some coali- tions of voters have the power to enforce their will regardless other voters’ actions, while the remaining ... Voir le document complet
10
Sujets connexes