Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 16.

Add to Quick Collection   All 16 Results

Sort:
 Add All Items to Quick Collection
Date: 2017
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1250986
Description: Dynamic systems are becoming steadily more important with the profusion of mobile and distributed computing devices. Coincidentally incremental computation is a natural approach to deal with ongoing c ... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1250752
Description: Trees are a fundamental structure in algorithmics. In this paper, we study the transformation of an arbitrary binary tree S with n vertices into a completely balanced tree T via rotations , a widely s ... More
Reviewed: Reviewed
Date: 2016
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1055140
Description: Given a function f in a finite field Fq of q elements, we define the functional graph of f as a directed graph on q nodes labelled by the elements of Fq where there is an edge from u to v if and only ... More
Reviewed: Reviewed
Date: 2015
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/352624
Description: We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm f ... More
Reviewed: Reviewed
Date: 2014
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/335993
Description: Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modeling modern wireless, mobile and dynamic environments. As a graph evolves, pos ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/279821
Description: We study the problem of augmenting a weighted graph by inserting edges of bounded total cost while minimizing the diameter of the augmented graph. Our main result is an FPT 4-approximation algorithm f ... More
Reviewed: Reviewed
Date: 2013
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/275797
Description: Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, po ... More
Reviewed: Reviewed
Date: 2012
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/314178
Description: We study a wide class of graph editing problems that ask whether a given graph can be modified to satisfy certain degree constraints, using a limited number of vertex deletions, edge deletions, or edg ... More
Reviewed: Reviewed
Date: 2012
Subject Keyword: 110300 Clinical Sciences
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/200227
Description: Background: One primary goal of transcriptomic studies is identifying gene expression patterns correlating with disease progression. This is usually achieved by considering transcripts that independen ... More
Reviewed: Reviewed
Date: 2011
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/156322
Description: Novel analytical techniques have dramatically enhanced our understanding of many application domains including biological networks inferred from gene expression studies. However, there are clear compu ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/140996
Description: Therapies consisting of a combination of agents are an attractive proposition, especially in the context of diseases such as cancer, which can manifest with a variety of tumor types in a single case. ... More
Reviewed: Reviewed
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/140999
Description: Clustering, particularly hierarchical clustering, is an important method for understanding and analysing data across a wide variety of knowledge domains with notable utility in systems where the data ... More
Reviewed: Reviewed
Authors: Mathieson, Luke
Date: 2010
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/137046
Description: We examine the parameterized complexity of the problem of editing a graph to obtain an r-degenerate graph. We show that for the editing operations vertex deletion and edge deletion, both separately an ... More
Reviewed: Reviewed
Date: 2008
Subject Keyword: 080300 Computer Software
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/138053
Description: We study the parameterized complexity of the following problem: is it possible to make a given graph r-regular by applying at most k elementary editing operations; the operations are vertex deletion, ... More
Reviewed: Reviewed
Date: 2008
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/138066
Description: We study variants and generalizations of the problem of finding an r-regular subgraph (where r ≥ 3) in a given graph by deleting at most k vertices. Moser and Thilikos (2006) have shown that the probl ... More
Reviewed: Reviewed