Skip to main content

Research Repository

Advanced Search

Outputs (24)

Approximating the number of acyclic orientations for a class of sparse graphs (2004)
Journal Article
Bordewich, M. (2004). Approximating the number of acyclic orientations for a class of sparse graphs. Combinatorics, Probability and Computing, 13(1), 1-16. https://doi.org/10.1017/s0963548303005844

The Tutte polynomial $T(G;x,y)$ of a graph evaluates to many interesting combinatorial quantities at various points in the $(x,y)$ plane, including the number of spanning trees, number of forests, number of acyclic orientations, the reliability polyn... Read More about Approximating the number of acyclic orientations for a class of sparse graphs.

A generative classification of mesh refinement rules with lattice transformations (2004)
Journal Article
Ivrissimtzis, I., Dodgson, N., & Sabin, M. (2004). A generative classification of mesh refinement rules with lattice transformations. Computer Aided Geometric Design, 21(1), 99-109. https://doi.org/10.1016/j.cagd.2003.08.001

We give a classification of subdivision refinement rules using similarity transformations of lattices. Our work expands recent results in the classification of primal triangular subdivision. In the examples we concentrate on the cases with a low rati... Read More about A generative classification of mesh refinement rules with lattice transformations.

Constraint satisfaction problems on intervals and lengths (2004)
Journal Article
Krokhin, A., Jeavons, P., & Jonsson, P. (2004). Constraint satisfaction problems on intervals and lengths. SIAM Journal on Discrete Mathematics, 17(3), 453-477. https://doi.org/10.1137/s0895480102410201

We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as INTER... Read More about Constraint satisfaction problems on intervals and lengths.