Outputs (2884)

Identifying phylogenetic trees (2005)
Journal Article
Bordewich, M., Huber, K., & Semple, C. (2005). Identifying phylogenetic trees. Discrete Mathematics, 300(1-3), 30-43. https://doi.org/10.1016/j.disc.2005.06.015

A central problem that arises in evolutionary biology is that of displaying partitions of subsets of a finite set X on a tree whose vertices are partially labelled with the elements of X. Such a tree is called an X-tree and, for a collection C of par... Read More about Identifying phylogenetic trees.

Plausible 3D Colour Surface Completion using Non-parametric Techniques (2005)
Presentation / Conference Contribution
Breckon, T., & Fisher, R. (2005, September). Plausible 3D Colour Surface Completion using Non-parametric Techniques. Presented at Proc. Mathematics of Surfaces XI Institute of Mathematics and its Applications

Identifying Structural Features of Java Programs by Analysing the Interaction of Classes at Runtime (2005)
Presentation / Conference Contribution
Smith, M., & Munro, M. (2005, September). Identifying Structural Features of Java Programs by Analysing the Interaction of Classes at Runtime. Presented at International Workshop on Visualizing Software for Understanding and Analysis (VISSOFT), Budapest

A Framework for Software Architecture Visualization Assessment (2005)
Presentation / Conference Contribution
Gallagher, K., Hatch, A., & Munro, M. (2005, September). A Framework for Software Architecture Visualization Assessment. Presented at Proceedings of the 3rd IEEE Workshop on Visualizing Software (VISSOFT 2005, Budapest, Hungary

In order to assess software architecture visualisation strategies, we qualitatively characterize then construct an assessment framework with 7 key areas and 31 features. The framework is used for evaluation and comparison of various strategies from m... Read More about A Framework for Software Architecture Visualization Assessment.

Virtual organization for realcourse (2005)
Book Chapter
Song, W., & Li, X. (2005). Virtual organization for realcourse. In A. Nilsson, R. Gustas, W. Wojtkowski, W. Wojtkowski, S. Wrycza, & J. Zupancic (Eds.), Advances in information system development : bridging the gap between academia & system development. Springer Verlag

SkvG: Cache-Optimal Parallel Solution of PDEs on High Performance Computers Using Space-Trees and Space-Filling Curves (2005)
Presentation / Conference Contribution
Langlotz, M., Mehl, M., Weinzierl, T., & Zenger, C. (2005, August). SkvG: Cache-Optimal Parallel Solution of PDEs on High Performance Computers Using Space-Trees and Space-Filling Curves

Matrix and graph orders derived from locally constrained graph homomorphisms (2005)
Presentation / Conference Contribution
Fiala, J., Paulusma, D., & Telle, J. A. (2023, August). Matrix and graph orders derived from locally constrained graph homomorphisms. Presented at 30th International Symposium on Mathematical Foundations of Computer Science : MFCS 2005, Gdansk, Poland

We consider three types of locally constrained graph homomorphisms: bijective, injective and surjective. We show that the three orders imposed on graphs by existence of these three types of homomorphisms are partial orders. We extend the well-known c... Read More about Matrix and graph orders derived from locally constrained graph homomorphisms.

Supermodular functions and the complexity of MAX CSP (2005)
Journal Article
Cohen, D., Cooper, M., Jeavons, P., & Krokhin, A. (2005). Supermodular functions and the complexity of MAX CSP. Discrete Applied Mathematics, 149(1-3), 53-72. https://doi.org/10.1016/j.dam.2005.03.003

In this paper we study the complexity of the maximum constraint satisfaction problem (MAX CSP) over an arbitrary finite domain. An instance of MAX CSP consists of a set of variables and a collection of constraints which are applied to certain specifi... Read More about Supermodular functions and the complexity of MAX CSP.

Path coupling using stopping times (2005)
Presentation / Conference Contribution
Bordewich, M., Dyer, M., & Karpinski, M. (2005, August). Path coupling using stopping times. Presented at 15th International Symposium Fundamentals of Computation Theory : FCT 2005., Lubeck, Germany

We analyse the mixing time of Markov chains using path coupling with stopping times. We apply this approach to two hypergraph problems. We show that the Glauber dynamics for independent sets in a hypergraph mixes rapidly as long as the maximum degree... Read More about Path coupling using stopping times.

The External Network Problem with edge- or arc-connectivity requirements (2005)
Presentation / Conference Contribution
van den Heuvel, J., & Johnson, M. (2004, August). The External Network Problem with edge- or arc-connectivity requirements. Presented at Combinatorial and Algorithmic Aspects of Networking (CAAN 2004), Banff, Alberta, Canada

The connectivity of a communications network can often be enhanced if the nodes are able, at some expense, to form links using an external network. In this paper, we consider the problem of how to obtain a prescribed level of connectivity with a mini... Read More about The External Network Problem with edge- or arc-connectivity requirements.