Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graphe pondéré")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 481

  • Page / 20
Export

Selection :

  • and

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

A PARALLEL ALGORITHM FOR CONSTRUCTING MINIMUM SPANNING TREESBENTLEY JL.sdANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL AND COMPUTING. 17/1979/MONTICELLO IL; USA; URBANA-CHAMPAIGN: UNIVERSITY OF ILLINOIS; DA. S.D.; PP. 11-20; BIBL. 12 REF.Conference Paper

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(n3/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 2m 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

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

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

On identification of graphs of regular functional configurationsZAKOWSKI, W.Bulletin of the Polish Academy of Sciences. Technical sciences. 1990, Vol 38, Num 1-12, pp 89-93, issn 0239-7528Article

MATCHINGS AND SPANNING TREES IN BOOLEAN WEIGHTED GRAPHSBERMAN KA.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 3; PP. 343-350; BIBL. 4 REF.Article

DATA-DEPENDENT BOUNDS FOR HEURISTICS TO FIND A MINIMUM WEIGHT HAMILTONIAN CIRCUITJONKER R; KAAS R; VOLGENANT T et al.1980; OPER. RES.; ISSN 0030-364X; USA; DA. 1980; VOL. 28; NO 5; PP. 1219-1222; BIBL. 5 REF.Article

An explicit formula for differences between Laplacian-eigenvector components using coalesced graphsROY, Sandip; YAN WAN.Linear algebra and its applications. 2010, Vol 433, Num 7, pp 1329-1335, issn 0024-3795, 7 p.Article

Updating directed minimum cost spanning treesPOLLATOS, Gerasimos G; TELELIS, Orestis A; ZISSIMOPOULOS, Vassilis et al.Lecture notes in computer science. 2006, pp 291-302, issn 0302-9743, isbn 3-540-34597-3, 1Vol, 12 p.Conference Paper

Negotiation-range mechanisms: Coalition-resistant marketsGONEN, Rica.Lecture notes in computer science. 2004, pp 383-394, issn 0302-9743, isbn 3-540-23025-4, 12 p.Conference Paper

Distributed weighted matchingWATTENHOFER, Mirjam; WATTENHOFER, Roger.Lecture notes in computer science. 2004, pp 335-348, issn 0302-9743, isbn 3-540-23306-7, 14 p.Conference Paper

Enumerating global roundings of an outerplanar graphTAKKI-CHEBIHI, Nadia; TOKUYAMA, Takeshi.Lecture notes in computer science. 2003, pp 425-433, issn 0302-9743, isbn 3-540-20695-7, 9 p.Conference Paper

Finding minimal branchings with a given number of arcsCVETKOVIC, Dragos; CANGALOVIC, Mirjana.Yugoslav journal of operations research. 2002, Vol 12, Num 1, pp 1-10, issn 0354-0243, 10 p.Article

  • Page / 20