360 search results - page 55 / 72 » Explanations and Proof Trees |
EJC
2010
13 years 8 months ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
GC
2008
Springer
13 years 8 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
JAIR
2006
13 years 8 months ago
2006
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
CORR
2002
Springer
13 years 8 months ago
2002
Springer
Different types of two- and three-dimensional representations of a finite metric space are studied that focus on the accurate representation of the linear order among the distance...