Brunel University Research Archive (BURA) >

Browsing by Author Noble, SD

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 10 of 10
Issue DateTitleAuthor(s)
2012The complexity of two graph orientation problemsEggemann, N; Noble, SD
2004Domination Analysis of Greedy Heuristics For The Frequency Assignment ProblemKoller, AE; Noble, SD
2009The equivalence of two graph polynomials and a symmetric functionMerino, C; Noble, SD
2006Evaluating the rank generating function of a graphic 2-polymatroidNoble, SD
2011Maximizing edge-ratio is NP-completeNoble, SD; Hansen, P; Mladenović, N
2009Minimizing the oriented diameter of a planar graphEggemann, N; Noble, SD
1996Recognising a partitionable simplicial complex is in NPNoble, SD
2011Some inequalities for the Tutte polynomialChavez-Lomeli, LE; Merino, C; Noble, SD; Ramirez-Ibanez, M
2011The Tutte polynomial characterizes simple outerplanar graphsGoodall, AJ; de Mier, A; Noble, SD; Noy, M
2011The Tutte polynomial characterizes simple outerplanar graphsGoodall, AJ; de Mier, A; Noble, SD; Noy, M
Showing results 1 to 10 of 10

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan