131
click to vote
GC
2016
Springer
9 years 12 months ago
2016
Springer
Let s(n, t) be the maximum number of colors in an edge-coloring of the complete graph Kn that has no rainbow spanning subgraph with diameter at most t. We prove s(n, t) = n−2 2 ...
237
Voted
GC
2016
Springer
9 years 12 months ago
2016
Springer
A mixed hypergraph is a triple H = (V, C, D), where V is a set of vertices, C and D are sets of hyperedges. A vertex-coloring of H is proper if C-edges are not totally multicolored...
169
click to vote
GC
2016
Springer
9 years 12 months ago
2016
Springer
The pseudoachromatic index of a graph is the maximum number of colors that can be assigned to its edges, such that each pair of different colors is incident to a common vertex. I...
GAMES
2016
9 years 12 months ago
2016
Two experimental treatments are used to study the e↵ects of auction risk across five mechanisms. The first canonical, baseline treatment features only strategic risk and repli...
FUIN
2016
9 years 12 months ago
2016
Abstract. In this paper, we propose a new method for choosing implications. Our method allows to compare two fuzzy implications. If the truth value of the antecedent and the truth ...
FUIN
2016
9 years 12 months ago
2016
Abstract. We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS...
FUIN
2016
9 years 12 months ago
2016
based Rewriting through Abstraction Paolo Bottoni1, Esther Guerra2, Juan de Lara2 1 Computer Science Department, “Sapienza” Universit`a di Roma (Italy) 2 Computer Science Depar...
FUIN
2016
9 years 12 months ago
2016
Parsing Expression Grammar (PEG) encodes a recursive-descent parser with limited backtracking. It has been recently noticed that in the situation when the parser is to explore sev...