[PDF] Top 20 A Combinatorial problem in hamming graphs and its solution in scratchpad
Has 10000 "A Combinatorial problem in hamming graphs and its solution in scratchpad" found on our website. Below are the top 20 most common "A Combinatorial problem in hamming graphs and its solution in scratchpad".
A Combinatorial problem in hamming graphs and its solution in scratchpad
... L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignemen[r] ... Voir le document complet
15
Study of a combinatorial game in graphs through Linear Programming
... such a strategy (assigning disjoint subtrees to each guard) is not necessarily optimal in trees (see Section ...Domination Problem [15]. In the latter game, a team of mobile agents ... Voir le document complet
25
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
... understanding and could be applied for solving the problem on other ...among a cer- tain number of solutions it is easily ...note in [ 7 ], the GRG solver does not guarantee the global opti- ... Voir le document complet
14
RETA : A Schema-Aware, End-to-End Solution for Instance Completion in Knowledge Graphs
... facts) in modern KGs. A fact in a KG is represented as a triplet (ℎ, 𝑟, 𝑡 ) linking two entities ℎ and 𝑡 via a relation 𝑟 ...this problem, i.e., given two elements ... Voir le document complet
12
Study of a Combinatorial Game in Graphs Through Linear Programming
... that, in the case s = 1, then gn 1,d (G) = 1 since once a guard is at distance d from the spy (which can be the case initially), the same guard can keep its distance at most d from the spy if the ... Voir le document complet
28
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization
... nominal problem is that it does not take into account pos- sible delays that can occur in the operational phase and that can affect the feasibility and the quality of the ...if a ... Voir le document complet
406
Study of a combinatorial game in graphs through Linear Programming
... v and then each of the cops is allowed to move to one of its neighbors or may stay idle such that at least one cop occupies v (note that in the original variant, only one agent was allowed to move at ... Voir le document complet
23
A relaxed approach to combinatorial problems in robustness and diagnostics
... (LTS) in sim- ple linear regression to illustrate how iterations proceed from different starting ...out a key advantage of the gradient descent feature of our algo- rithm: the algorithm can start from ... Voir le document complet
17
Randomly colouring graphs (a combinatorial view)
... decision problem associated with the chromatic number was one of the first problems shown to be NP-complete, in Karp’s paper ...Johnson, and Stockmeyer [64] proved that the problem remains ... Voir le document complet
72
Converse and duality results for combinatorial source-channel coding in binary Hamming spaces
... binary Hamming space, the adversarial source problem is a covering problem and the adversarial channel problem is a packing ...covering problem, the asymptot- ... Voir le document complet
6
A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem
... P` a ; O? X 7>T; >9 >9 ; >W SN ; ?>PS ;b :O;9S R9 >Q 9 :>?Z V O98S>7O8= 8XX 7>YO? 8SO>9 8=[>7OSN? W >7 W78:SO>9 8= ?\ =SO:>? ?> UOSE ] >Q VE \ PO9 [ 89 O9 :7; ?;9 ... Voir le document complet
5
Large scale cavity dissolution: From the physical problem to its numerical solution
... blocks. In this paper, we use the cell-based AMR for the DIM model with a fully implicit solving, considering that the mass exchange terms have strong impact on all the balance equations and the ... Voir le document complet
18
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
... Introduction In a graph, an independent set is a subset of vertices no two of which are adja- ...set problem consists in nding in a graph an independent set of maximum ... Voir le document complet
13
Solution to a problem of Diestel
... have a great impact on the geometry of Banach ...of a projective tensor product can be quite complicated, even for the simplest component ...exists a subspace of c 0 ⊗ b π c 0 which fails to have the ... Voir le document complet
8
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
... contribution In this article, we mainly deal with complexity and approximability issues for MinCVC in particular classes of ...polynomial in chordal graphs (Section 3). Then, in ... Voir le document complet
22
Large scale cavity dissolution: From the physical problem to its numerical solution
... blocks. In this paper, we use the cell-based AMR for the DIM model with a fully implicit solving, considering that the mass exchange terms have strong impact on all the balance equations and the ... Voir le document complet
17
Combinatorial identities and Titchmarsh's divisor problem for multiplicative functions
... problems in number theory can be rephrased in terms of correlations of arithmetic functions, the twin prime con- jecture or the Goldbach conjecture being two famous examples (see ...prominently in ... Voir le document complet
31
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem
... by a single LPB are called threshold func- tions. The problem of finding the LPB for a threshold function given as disjunc- tive normal form (DNF) is called threshold synthesis ...entirely ... Voir le document complet
6
A Pretty Complete Combinatorial Algorithm for the Threshold Synthesis Problem
... vals, and within it, the northwest-southeast diagonals, as illustrated by the dashed shapes in the figure to the ...numbers, and we compute the difference between the upper left and the lower ... Voir le document complet
7
Mg-Zr alloy corrosion in Na-geopolymer and its synthetic pore solution
... Elementary X-ray Mapping - (after 6 months exposure) Presence of two different phases: 4-5 µm thick Mg and O rich → brucite Mg(OH) 2 or MgO Mg, O, Na, F rich → mixture of Mg(OH) 2 , NaF, MgF 2 , NaMgF 3 , ... Voir le document complet
22
Sujets connexes