Combinatorial structures associated with Lie algebras of finite dimensionCARRIAZO, A; FERNANDEZ, L. M; NUNEZ, J et al.Linear algebra and its applications. 2004, Vol 389, pp 43-61, issn 0024-3795, 19 p.Article

On the spectral radius of weighted trees with fixed diameter and weight setTAN, Shang-Wang; YAO, Yan-Hong.Linear algebra and its applications. 2009, Vol 431, Num 1-2, pp 86-98, issn 0024-3795, 13 p.Article

Parametric problems on graphs of bounded tree-widthFERNANDEZ-BACA, D; SLUTZKI, G.Journal of algorithms (Print). 1994, Vol 16, Num 3, pp 408-430, issn 0196-6774Article

Weighted degrees and heavy cycles in weighted graphsFUJISAWA, Jun.Discrete mathematics. 2009, Vol 309, Num 23-24, pp 6483-6495, issn 0012-365X, 13 p.Article

The energy change of weighted graphsGUTMAN, Ivan; SHAO, Jia-Yu.Linear algebra and its applications. 2011, Vol 435, Num 10, pp 2425-2431, issn 0024-3795, 7 p.Article

Ore-type degree condition for heavy paths in weighted graphsENOMOTO, Hikoe; FUJISAWA, Jun; OTA, Katsuhiro et al.Discrete mathematics. 2005, Vol 300, Num 1-3, pp 100-109, issn 0012-365X, 10 p.Article

Spectra of weighted generalized Bethe trees joined at the rootROJO, Oscar.Linear algebra and its applications. 2008, Vol 428, Num 11-12, pp 2961-2979, issn 0024-3795, 19 p.Article

A sharp upper bound on the spectral radius of weighted graphsDAS, Kinkar Ch; BAPAT, R. B.Discrete mathematics. 2008, Vol 308, Num 15, pp 3180-3186, issn 0012-365X, 7 p.Article

A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphsROJO, Oscar.Linear algebra and its applications. 2007, Vol 420, Num 2-3, pp 625-633, issn 0024-3795, 9 p.Article

A sharp upper bound on the largest Laplacian eigenvalue of weighted graphsDAS, Kinkar Ch; BAPAT, R. B.Linear algebra and its applications. 2005, Vol 409, pp 153-165, issn 0024-3795, 13 p.Article

Efficient algorithms for the weighted 2-center problem in a cactus graphBEN-MOSHE, Boaz; BHATTACHARYA, Binay; QIAOSHENG SHI et al.Lecture notes in computer science. 2005, pp 693-703, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 11 p.Conference Paper

On clustering using random walksHAREL, David; KOREN, Yehuda.Lecture notes in computer science. 2001, pp 18-41, issn 0302-9743, isbn 3-540-43002-4Conference Paper

1-Approximation algorithm for bottleneck disjoint path matchingDATTA, A. K; SEN, R. K.Information processing letters. 1995, Vol 55, Num 1, pp 41-44, issn 0020-0190Article

Proximity Graphs Inside Large Weighted GraphsABREGO, Bernardo M; FABILA-MONROY, Ruy; FERNANDEZ-MERCHANT, Silvia et al.Networks (New York, NY). 2013, Vol 61, Num 1, pp 29-39, issn 0028-3045, 11 p.Article

A Neuro-Evolutionary Corpus-Based Method for Word Sense DisambiguationAZZINI, Antonia; DA COSTA PEREIRA, Célia; DRAGONI, Mauro et al.IEEE intelligent systems. 2012, Vol 27, Num 6, pp 26-35, issn 1541-1672, 10 p.Article

On the hardness of embeddings between two finite metricsCARY, Matthew; RUDRA, Atri; SABHARWAL, Ashish et al.Lecture notes in computer science. 2005, pp 1412-1423, issn 0302-9743, isbn 3-540-27580-0, 12 p.Conference Paper

All-pairs shortest paths with real weights in O(n³/logn) timeCHAN, Timothy M.Lecture notes in computer science. 2005, pp 318-324, issn 0302-9743, isbn 3-540-28101-0, 7 p.Conference Paper

A series of search designs for 2^m factorial designs of resolution V which permit search of one or two unknown extra three-factor interactionsSHIRAKURA, T; TAZAWA, S.Annals of the Institute of Statistical Mathematics. 1992, Vol 44, Num 1, pp 185-196, issn 0020-3157Article

A novel neural network approach to solve exact and inexact graph isomorphism problemsJAIN, Brijnesh J; WYSOTZKI, Fritz.Lecture notes in computer science. 2003, pp 299-306, issn 0302-9743, isbn 3-540-40408-2, 8 p.Conference Paper

Empirical temporal networks of face-to-face human interactionsBARRAT, A; CATTUTO, C; STEHLE, J et al.The European physical journal. Special topics. 2013, Vol 222, Num 6, pp 1295-1309, issn 1951-6355, 15 p.Article

Practical construction of k-nearest neighbor graphs in metric spacesPAREDES, Rodrigo; CHAVEZ, Edgar; FIGUEROA, Karina et al.Lecture notes in computer science. 2006, pp 85-97, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 13 p.Conference Paper

Edge dominating set : Efficient enumeration-based exact algorithmsFERNAU, Henning.Lecture notes in computer science. 2006, pp 142-153, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Improved linear time approximation algorithms for weighted matchingsDRAKE, Doratha E; HOUGARDY, Stefan.Lecture notes in computer science. 2003, pp 14-23, issn 0302-9743, isbn 3-540-40770-7, 10 p.Conference Paper

Hadwiger's conjecture for circular colorings of edge-weighted graphsFIJAVZ, Gasper.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 402-408, issn 0012-365X, 7 p.Article

Spectral characterization of some weighted rooted graphs with cliquesROJO, Oscar; MEDINA, Luis.Linear algebra and its applications. 2010, Vol 433, Num 7, pp 1388-1409, issn 0024-3795, 22 p.Article