Skip to main content

Research Repository

Advanced Search

Outputs (75)

A class of hierarchical graphs as topologies for interconnection networks (2010)
Journal Article
Lai, P., Hsu, H., Tsai, C., & Stewart, I. (2010). A class of hierarchical graphs as topologies for interconnection networks. Theoretical Computer Science, 411(31-33), 2912-2924. https://doi.org/10.1016/j.tcs.2010.04.022

We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k,n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In... Read More about A class of hierarchical graphs as topologies for interconnection networks.

Variability in the control of cell division underlies sepal epidermal patterning in Arabidopsis thaliana (2010)
Journal Article
Roeder, A. H., Chickarmane, V., Cunha, A., Obara, B., Manjunath, B., & Meyerowitz, E. M. (2010). Variability in the control of cell division underlies sepal epidermal patterning in Arabidopsis thaliana. PLoS Biology, 8(5), Article e1000367. https://doi.org/10.1371/journal.pbio.1000367

How growth and proliferation are precisely controlled in organs during development and how the regulation of cell division contributes to the formation of complex cell type patterns are important questions in developmental biology. Such a pattern of... Read More about Variability in the control of cell division underlies sepal epidermal patterning in Arabidopsis thaliana.

Path factors and parallel knock-out schemes of almost claw-free graphs (2010)
Journal Article
Johnson, M., Paulusma, D., & Wood, C. (2010). Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics, 310(9), 1413-1423. https://doi.org/10.1016/j.disc.2009.04.022

An H1,{H2}-factor of a graph G is a spanning subgraph of G with exactly one component isomorphic to the graph H1 and all other components (if there are any) isomorphic to the graph H2. We completely characterise the class of connected almost claw-fre... Read More about Path factors and parallel knock-out schemes of almost claw-free graphs.

Comparing universal covers in polynomial time (2010)
Journal Article
Fiala, J., & Paulusma., D. (2010). Comparing universal covers in polynomial time. Theory of Computing Systems, 46(4), 620-635. https://doi.org/10.1007/s00224-009-9200-z

The universal cover T G of a connected graph G is the unique (possibly infinite) tree covering G, i.e., that allows a locally bijective homomorphism from T G to G. It is well-known that if a graph G covers a graph H, then their universal covers are i... Read More about Comparing universal covers in polynomial time.

A Network Approach to Study Karyotypic Evolution: The Chromosomal Races of the Common Shrew (Sorex araneus) and House Mouse (Mus musculus) as Model Systems (2010)
Journal Article
White, T. A., Bordewich, M., & Searle, J. B. (2010). A Network Approach to Study Karyotypic Evolution: The Chromosomal Races of the Common Shrew (Sorex araneus) and House Mouse (Mus musculus) as Model Systems. Systematic Biology, 59(3), 262-276. https://doi.org/10.1093/sysbio/syq004

The development of methods to reconstruct phylogenies from karyotypic data has lagged behind what has been achieved with molecular and morphological characters. This hampers our understanding of the role of chromosomal rearrangements in speciation, w... Read More about A Network Approach to Study Karyotypic Evolution: The Chromosomal Races of the Common Shrew (Sorex araneus) and House Mouse (Mus musculus) as Model Systems.

Automatic Salient Object Detection in UAV Imagery (2010)
Presentation / Conference Contribution
Sokalski, J., Breckon, T., & Cowling, I. (2010, April). Automatic Salient Object Detection in UAV Imagery. Presented at Proc. 25th International Conference on Unmanned Air Vehicle Systems

A new characterization of P6-free graphs (2010)
Journal Article
Hof, P. V. '., & Paulusma, D. (2010). A new characterization of P6-free graphs. Discrete Applied Mathematics, 158(7), 731-740. https://doi.org/10.1016/j.dam.2008.08.025

We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if and only if each connected induced subgraph of G on more than one vertex... Read More about A new characterization of P6-free graphs.

A general algorithm for detecting faults under the comparison diagnosis model (2010)
Presentation / Conference Contribution
Stewart, I. (2010, April). A general algorithm for detecting faults under the comparison diagnosis model. Presented at 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, Georgia, U.S.A

We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty processors. In particular, we prove that if the underlying graph G = (V,E... Read More about A general algorithm for detecting faults under the comparison diagnosis model.