Last week I reworked my first paper regarding the Contraction Approximation and managed to get the majority of the previous work and theory in order. Unfortunately, I could not complete the results section and beyond due to some unexpected issues with my collection of charts, graphs and images - some missing headers, some were under the wrong header and others I don't remember drawing.
This week I will be sorting through those images and gradually adding them into the paper, followed by a continuation on the multi-matching and how that affects the contraction approximation. My aim is to speed this out as quickly as possible so I can begin to look at dynamic graphs a bit more.
For the dynamic work, I have looked at a small example I will use to identify the behaviour of such a system and outline some development ideas for future use. The example is a model of an expanding auction site, with pages and entire sections being added and removed constantly. As this is just an example and a website is only one of many data collections which could be used, I am looking to implement some unexpected behaviour which I have yet to choose and investigate.
For my own enjoyment, part of this be a god mode which will add hundreds of vertices with edges between all pairs, to the graph.
The benefit of this example is that I will be able to use a data collection gathered by one of the University students when the algorithm is ready - without needing to test the algorithms progress. Why don't I just use the students work? The data I am expecting of them, is larger than I would like for a simple testing example, therefore I would prefer to use an example which is easy to manage to begin with.
These are all just plans though; the real work might turn out very different. For now, I want to finish my papers.
No comments:
Post a Comment