Browsing by Author Noble, S D
Showing results 1 to 10 of 10
Issue Date | Title | Author(s) |
---|---|---|
2009 | The clustering coefficient of a scale-free random graph | Eggemann, N; Noble, S D |
2008 | Counting cocircuits and convex two-colourings is #P-complete | Noble, S D |
2004 | Cyclic labellings with constraints at two distances | Leese, R; Noble, S D |
2009 | Evaluating a weighted graph polynomial for graphs of bounded tree-width | Noble, S D |
1998 | Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width | Noble, S D |
2004 | Finding next-to-shortest paths in a graph | Krasikov, I; Noble, S D |
2003 | Improved bounds for the number of forests and acyclic orientations in the square lattice | Calkin, N; Merino, C; Noble, S D; Noy, M |
2009 | k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4 | Eggemann, N; Havet, F; Noble, S D |
2000 | Knot Graphs | Noble, S D; Welsh, D J A |
2002 | Optimal arrangement of data in a tree directory | Luczak, M J; Noble, S D |