[PDF] Top 20 The complexity of tropical graph homomorphisms.
Has 10000 "The complexity of tropical graph homomorphisms." found on our website. Below are the top 20 most common "The complexity of tropical graph homomorphisms.".
The complexity of tropical graph homomorphisms.
... two tropical graphs (G, c 1 ) and (H, c), a homomorphism of (G, c 1 ) to (H, c) is a standard graph homomorphism of G to H that also preserves the ...initiate the study of ... Voir le document complet
27
The complexity of signed and edge-coloured graph homomorphisms.
... List homomorphisms For a fixed graph H, the list homomorphism problem for fixed H, denoted ListHom(H), is defined over inputs consisting of pairs (G, L) where G is a graph and L is a ... Voir le document complet
21
Complexity of determining the irregular chromatic index of a graph
... output of each clause gadget spreads the true signal, while its other outputs (there are at most two of them) propa- gate the false ...) of G F has exactly one output and, according to ... Voir le document complet
17
Complexity of Acyclic Term Graph Rewriting
... concludes the base case. The inductive step then follows directly from the induction hypothesis and weak monotonicity of the ...Conceptually, the semantics imposed by a ... Voir le document complet
19
Homomorphisms of partial t-trees and edge-coloring of partial 3-trees
... that the restriction of Seymour’s conjecture on cubic (planar) graphs is Tait’s reformulation of the four-color ...for the larger class of K 5 -minor-free graphs (which includes ... Voir le document complet
21
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
... is the graph modification problem asking whether one can remove at most k vertices such that the resulting graph has no edges (we use u ∼ v for the adjacency ...a graph class ... Voir le document complet
20
Homomorphisms of sparse signed graphs
... x of G, f 1 specifies whether x is switched or not (according to whether f 1 (x) = + or −, respectively) and f 2 specifies to which vertex of V (H) the vertex x is ...result of [14] is that ... Voir le document complet
27
Complexity issues in Vertex-Colored Graph Pattern Matching
... 3.2.1. The Min-CC problem is fixed-parameter tractable Let G be a graph and k be a positive ...F of functions from V(G) to {1, 2, ...V(G) of k vertices there is a function f ∈ F which is ... Voir le document complet
34
The Complexity of bottleneck labeled graph problems
... I, the goal is to solve min y∈F (x) {w 1 (x, y), ...where the exact meaning of “min” depends on the particular setting in ...minimize the worst cost function, or for lexicographically ... Voir le document complet
18
On the complexity of partial derivatives
... from the problem of counting the number of independent sets in a graph, and use as an intermediate step a problem of topological ...∆ of subsets of a finite set S ... Voir le document complet
19
Non axiomatisability of positive relation algebras with constants, via graph homomorphisms
... As the size of the graphs of e n and f n grows infinitely, the set of inequations (f n 0 ≤ e 0 n ) n∈ω is ...that the above proposition is stronger than necessary: we ... Voir le document complet
24
Complexity of planar signed graph homomorphisms to cycles
... problems of signed graphs from a computational point of ...signed graph is an undirected graph where each edge is given a sign, positive or ...is the operation of switching at a ... Voir le document complet
18
The Bipartite Swapping Trick on Graph Homomorphisms
... d-regular graph G, and positive integer n, iðG; nÞ ≤ iðK d;d ; nÞ N ∕ ð2dÞ : The collection I ðG; nÞ arises naturally in statistical mechanics [9] and communica- tion networks [4], ...to the ... Voir le document complet
22
On the Complexity of Concurrent Multiset Rewriting
... Still, the prob- lem of searching reactants is not addressed in [9], which focuses on classic issues in distributed systems such as mutual exclusion, and on how existing solutions to this problem can be ... Voir le document complet
18
On the Complexity of the Plantinga-Vegter Algorithm
... Outline The rest of the paper is structured as follows: We start with a section that contains ...seemed the simplest way for getting things ...discuss the Plantinga-Vegter algorithm and ... Voir le document complet
33
The Complexity of the California Recall Election
... as the absolute vote of the top candidate decreases (McClintock < Bustamante < ...is the causal mechanism producing the vertical proximity effect? One possible answer, is voter ... Voir le document complet
12
On the Grundy number of a graph
... Hence the Grundy number and its ratio with the chromatic number measure how bad the greedy algorithm may perform on a ...Determining the chromatic number of a graph is well-known ... Voir le document complet
11
On the complexity of the model checking problem
... that the class of CSPs exhibits dichotomy; that is, CSP( D) is always either in P or is NP-complete, depending on the model ...structures of size at most three [6], for undirected graphs [16], ... Voir le document complet
30
Graph properties of graph associahedra
... Generalizing the classical associahedron, ...constructed graph associahedra . Given a finite graph G, a G-associahedron Asso(G) is a simple convex polytope whose combinatorial structure encodes ... Voir le document complet
27
On the complexity of skew arithmetic
... Various complexity results for computations with linear dierential operators and other skew polynomials were previously obtained [ 17 , 14 , 15 , 25 , 16 , 4 ...Especially the compu- tation of ... Voir le document complet
16
Sujets connexes