[PDF] Top 20 The Complexity of bottleneck labeled graph problems
Has 10000 "The Complexity of bottleneck labeled graph problems" found on our website. Below are the top 20 most common "The Complexity of bottleneck labeled graph problems".
The Complexity of bottleneck labeled graph problems
... The Complexity of Bottleneck Labeled Graph Problems Refael Hassin ∗ J´ erˆ ome Monnot † Danny Segev ∗ Abstract In the present paper, we study bottleneck ... Voir le document complet
18
On the Complexity of two Problems on Orientations of Mixed Graphs
... show the reverse implication. We consider the set {Y 1h 1 , Y 2h 2 , ...P-orientation of G. Each path Yih i is the orientation (from the source towards the target vertex) ... Voir le document complet
11
Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems
... 14 The problem RDC 1 is NP-complete, even when restricted to trees where each colour appears at most ...consider the construction in the proof of Proposition 10, where every middle vertex M ... Voir le document complet
31
Complexity of Acyclic Term Graph Rewriting
... Term Graph Rewriting A graph rewrite rule over the signature F is a triple (G, l, r) where G is a TG over F and l, r ∈ N G are two distinguished nodes, denoting the root of the ... Voir le document complet
19
A note on the hardness results for the labeled perfect matching problems in bipartite graphs
... Keywords: labeled matching; bipartite graphs; approximation and complexity; inap- proximation ...a graph G = (V, E) is a subset of edges that are pairwise non adjacent; M is said perfect if it ... Voir le document complet
9
The complexity of tropical graph homomorphisms.
... Recall the dichotomy theorem for list homomorphism problems of Feder, Hell and Huang (Theorem ...arc graph, otherwise NP-complete. Alternatively, the latter class of graphs was ... Voir le document complet
27
On Labeled Traveling Salesman Problems
... on labeled network optimization problems includes sev- eral interesting results from both perspectives of hardness and approximation ...[10] the authors investigate weighted generalizations ... Voir le document complet
12
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
... Parameterized Complexity. We refer to the books [6, 7, 9, 17] for the detailed intro- duction to the ...review the basic notions. Parameterized Complexity is a bivariate ... Voir le document complet
20
Complexity of planar signed graph homomorphisms to cycles
... study of the algorithmic properties of homomorphism problems is a rich area of research that has gained a lot of ...to the book [26] as a reference on graph ... Voir le document complet
18
On complexity and approximability of the Labeled maximum/perfect matching problems
... lecture of each one of them and it would be desirable that (s)he visits not twice the same ...Hence the lectures to be attended would form a maximum ...convenience the inspector would ... Voir le document complet
10
Labeled Traveling Salesman Problems: Complexity and approximation
... NP-hardness of the problem of finding a long path/cycle of a minimum number of colors and provide exponential time exact and heuristic ...Salesman The only work that we are aware ... Voir le document complet
17
How the structure of precedence constraints may change the complexity class of scheduling problems
... to the fact that the class of empty graphs is not included in bounded-width graphs ...Open problems For an arbitrary number of machines and the makespan criterion, the ... Voir le document complet
34
Complexity issues in Vertex-Colored Graph Pattern Matching
... in the analysis of biological networks ...views of graph motifs. Topological motifs (patterns occurring in the network) are the classical view [22, 23, 30–32] and computationally ... Voir le document complet
34
Complexity of Task Graph Scheduling with Fixed Communication Capacity
... Unite´ de recherche INRIA Lorraine, Technopoˆle de Nancy-Brabois, Campus scientifique, 615 rue du Jardin Botanique, BP 101, 54600 VILLERS LE`S NANCY Unite´ de recherche INRIA Rennes, Iri[r] ... Voir le document complet
50
Complexity theoretic aspects of problems in control theory
... While the perfect information problem was known to be polynomial, the corresponding imperfect information problem, as well as the corresponding problem of decentralized c[r] ... Voir le document complet
6
A survey of graph and subgraph isomorphism problems
... Complexity resuits, combinatorial and group theoretic approaches to solve graph isornorphism problem are shown as well as polynomial time algorithrns on special cases of graphs such as t[r] ... Voir le document complet
134
Evaluation of Kermeta for Solving Graph-based Problems
... language, the developer has to learn a new language and the environment is not as mature as an Eclipse ...forces the developer to manage lots of concerns (tree traversal algorithms, object ... Voir le document complet
11
Approximation Algorithms and Hardness Results for Labeled Connectivity Problems
... Keywords: Labeled connectivity, approximation algorithms, hardness of ...many graph connectivity problems each edge is associated with a numerical attribute, which may represent length, weight ... Voir le document complet
16
Vertex-uncertainty in graph-problems
... in the data-set describing I has a probability p i , indicating how d i is likely to be present in the final sub-instance I 0 ...specified, the solver has no opportunity to solve it directly (for ... Voir le document complet
22
Complexity and approximation of satisfactory partition problems
... is a ρ-approximation for a 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|) . We say that a maximization problem is constant ... Voir le document complet
10
Sujets connexes