123 search results - page 14 / 25 » Argument graphs and assumption-based argumentation |
RANDOM
2001
Springer
14 years 2 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
JCT
2010
13 years 8 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
COCOON
2007
Springer
14 years 4 months ago
2007
Springer
The regularity lemma of Szemer´edi gives a concise approximate description of a graph via a so called regular-partition of its vertex set. In this paper we address the following ...
CP
2004
Springer
14 years 3 months ago
2004
Springer
Many backtracking algorithms exhibit heavy-tailed distributions, in which their running time is often much longer than their median. We analyze the behavior of two natural variant...
COMMA
2008
13 years 11 months ago
2008
An abstract framework for formalising persuasion dialogues has recently been proposed. The framework provides for a range of speech acts, and protocols of varying levels of flexibi...