This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.For the abstract of this thesis, please see the attached PDF.This work was funded by a Marie Curie Early Stage Training Fellowship
(NET-ACE-programme) under grant number MEST-CT-2004-6724

Eggemann, Nicole

English

Brunel University Research Archive

A linear-time algorithm for finding treedecompositions of small treewidth.

A tourist guide through treewidth.

Approximations for λ-coloring of graphs.

Bidimensional parameters and local treewidth.

Brief annoucement: Nonsearchability of random power-law graphs.

Distance constrained labelings of graphs of bounded treewidth.

Emergence of scaling in random networks.

Fixed parameter algorithms for dominating set and related problems on planar graphs.

Fixed-parameter complexity of λ-labelings.

Lower bounds and algorithms for dominating sets in web graphs.

Mathematical results on scale-free random graphs.

Minimizing the oriented diameter of a planar graph.

Non-searchability of random power-law graphs.

Random Graph Dynamics.

Robbins’ theorem for mixed multigraphs.

Search in power law networks. Physical Reviews E,

Statistical mechanics of complex networks.

Structure of growing networks with preferential linking. Physical Review Letters,

The diameter of a scale-free random graph.

Variations on random graph models for the web.

Some applications of graph theory

Some applications of graph theory

Abstract

Similar works

Full text

Available Versions

Brunel University Research Archive