Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Connectivité")

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 2358

  • Page / 95
Export

Selection :

  • and

The average connectivity of a graphBEINEKE, Lowell W; OELLERMANN, Ortrud R; PIPPERT, Raymond E et al.Discrete mathematics. 2002, Vol 252, Num 1-3, pp 31-45, issn 0012-365XArticle

Increasing digraph arc-connectivity by arc addition, reversal and complementARKIN, Esther M; HASSIN, Refael; SHAHAR, Shimon et al.Discrete applied mathematics. 2002, Vol 122, Num 1-3, pp 13-22, issn 0166-218XArticle

THE PROBABILITY OF CONNECTEDNESS OF A LARGE UNLABELLED GRAPH.WRIGHT EM.1975; J. LONDON MATH. SOC.; G.B.; DA. 1975; VOL. 11; NO 1; PP. 13-16; BIBL. 7 REF.Article

ON THE CYCLIC CONNECTIVITY OF PLANAR GRAPHSPLUMMER MD.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 235-242; BIBL. 8 REF.Serial Issue

Segmentation d'images par analyse de connexité. Application au contrôle qualité en production horticole = Image segmentation by connectivity analysis. Application to quality control in horticultural productionRobe, Christian; Postaire, J. G.1991, 160 p.Thesis

Quasi-parity and perfect graphsRUSU, I.Information processing letters. 1995, Vol 54, Num 1, pp 35-39, issn 0020-0190Article

On locally k-critically n-connected graphsJIANJI SU.Discrete mathematics. 1993, Vol 120, Num 1-3, pp 183-190, issn 0012-365XArticle

On the cycle-isomorphism of graphsXINGXING YU.Journal of graph theory. 1991, Vol 15, Num 1, pp 19-27, issn 0364-9024Article

Risque athéromateux des principales connectivitesLIOTE, F; LEMAIRE, V; WEBER, A. J et al.L' Actualité rhumatologique. 2003, pp 54-72, issn 0065-1818, 19 p.Article

General definition of valence delta-values for molecular connectivityKIER, L. B; HALL, L. H.Journal of pharmaceutical sciences. 1983, Vol 72, Num 10, pp 1170-1173, issn 0022-3549Article

Variable Molecular Connectivity Indices for Predicting the Diamagnetic Susceptibilities of Organic CompoundsLAILONG MU; HONGMEI HE; WEIHUA YANG et al.Industrial & engineering chemistry research. 2009, Vol 48, Num 8, pp 4165-4175, issn 0888-5885, 11 p.Article

Lower-bounds on the connectivities of a graphESFAHANIAN, A. H.Journal of graph theory. 1985, Vol 9, Num 4, pp 503-511, issn 0364-9024Article

Network participation indices: characterizing component roles for information processing in neural networksKÖTTER, Rolf; STEPHAN, Klaas E.Neural networks. 2003, Vol 16, Num 9, pp 1261-1275, issn 0893-6080, 15 p.Article

Pneumopathie interstitielle non spécifique: la reconnaître et la prendre en charge = How to recognize and manage nonspecific interstitial pneumonia?NUNES, H; UZUNHAN, Y; PIVER, D et al.La Lettre du pneumologue. 2014, Vol 17, Num 5, pp 160-164, issn 1292-5977, 5 p.Article

Minimizing algebraic connectivity over connected graphs with fixed girthFALLAT, Shaun M; KIRKLAND, Steve; PATI, Sukanta et al.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 115-142, issn 0012-365XArticle

The maximum genus of graphs of diameter twoSKOVIERA, M.Discrete mathematics. 1991, Vol 87, Num 2, pp 175-180, issn 0012-365X, 6 p.Article

Irreducible snarks of given order and cyclic connectivityMACAJOVA, Edita; SKOVIERA, Martin.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 779-791, issn 0012-365X, 13 p.Article

A note about shortest cycle coversJINLONG SHU; ZHANG, Cun-Quan.Discrete mathematics. 2005, Vol 301, Num 2-3, pp 232-238, issn 0012-365X, 7 p.Article

Improved lower bound for the vertex connectivity of (δ; g)-cagesYUQING LIN; MILLER, Mirka; BALBUENA, Camino et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 162-171, issn 0012-365X, 10 p.Article

Complex relationships between structural and functional brain connectivityUDDIN, Lucina Q.Trends in cognitive sciences (Regular ed.). 2013, Vol 17, Num 12, pp 600-602, issn 1364-6613, 3 p.Article

Maintaining the 3-edge-connected components of a graph on-lineZVI GALIL; ITALIANO, G. F.SIAM journal on computing (Print). 1993, Vol 22, Num 1, pp 11-28, issn 0097-5397Article

Sufficient conditions for maximally connected dense graphsSONEOKA, T; NAKADA, H; IMASE, M et al.Discrete mathematics. 1987, Vol 63, Num 1, pp 53-66, issn 0012-365XArticle

On the connectivity function of a matroidSEYMOUR, P. D.Journal of combinatorial theory. Series B. 1988, Vol 45, Num 1, pp 25-30, issn 0095-8956Article

Path-connectivity in graphsHAGER, M.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 53-59, issn 0012-365XArticle

Connections in acyclic hypergraphsMAIER, D; ULLMAN, J. D.Theoretical computer science. 1984, Vol 32, Num 1-2, pp 185-199, issn 0304-3975Article

  • Page / 95