Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Chaîne graphe")

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

Results 1 to 25 of 122

  • Page / 5
Export

Selection :

  • and

Faithfulness in chain graphs: The discrete casePENA, Jose M.International journal of approximate reasoning. 2009, Vol 50, Num 8, pp 1306-1313, issn 0888-613X, 8 p.Article

Decomposition of graphs into chainsTHOMASSEN, C.Bulletin of the London Mathematical Society. 1986, Vol 18, Num 72, pp 248-254, issn 0024-6093Article

On the uniformity of the closed-set lattice of a treeKOH, K. M; POH, K. S.Discrete mathematics. 1986, Vol 61, Num 1, pp 61-70, issn 0012-365XArticle

Node coverings with odd chainsDE WERRA, D.Journal of graph theory. 1986, Vol 10, Num 2, pp 177-185, issn 0364-9024Article

HAMILTONIAN CHAINS IN SELF COMPLEMENTARY GRAPHS.CAMION P.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 173-183; BIBL. 8 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

THE NUMBER OF ANTICHAINS OF FINITE POWER SETSCVETKOVIC DM.1972; PUBL. INST. MATH.; YOUGOSL.; DA. 1972; VOL. 13; PP. 5-9; BIBL. 3 REF.Serial Issue

Bandwidth of chain graphsKLOKS, T; KRATSCH, D; MÜLLER, H et al.Information processing letters. 1998, Vol 68, Num 6, pp 313-315, issn 0020-0190Article

Digraphs with eularian chainsSKILTON, D. K.Journal of the Australian Mathematical Society. Series A, Pure mathematics. 1986, Vol 41, Num 3, pp 298-303, issn 0334-3316Article

Partitions of chains with minimum imbalanceMESSE, G.Cahiers du Centre d'études de recherche opérationnelle. 1985, Vol 27, Num 3-4, pp 235-245, issn 0008-9737Article

The set of minimal braids is Co-NP-completePATERSON, M. S; RAZBOROV, A. A.Journal of algorithms (Print). 1991, Vol 12, Num 3, pp 393-408, issn 0196-6774Article

Reducible chains in several types of 2-connected graphsFUJI ZHANG; XIAOFENG GUO.Discrete mathematics. 1992, Vol 105, Num 1-3, pp 285-291, issn 0012-365XArticle

Existence de cycles et chaînes dans des graphes orientés ou non en liaison avec des paramètres de ces graphes (connexité, stabilité, degré,...) = Existence of cycles and chains in oriented or non oriented graphs in relation to graph parameters (connectivity, stability, degree,...)MANOUSSAKIS, Yannis.1985, 125 pThesis

Paths, chains, and antipathsDE WERRA, D; PASCHE, C.Networks (New York, NY). 1989, Vol 19, Num 1, pp 107-115, issn 0028-3045, 9 p.Article

Existence de cycles et chaînes dans les graphes - Coloration de graphes = Existence of cycles and paths in graphs - Colorings of graphsHarkat Benhamdine, Amel; Li, Hao.1997, 154 p.Thesis

An historical note: Euler's Königsberg lettersSACHS, H; STIEBITZ, M; WILSON, R. J et al.Journal of graph theory. 1988, Vol 12, Num 1, pp 133-139, issn 0364-9024Article

Nowhere-zero integral chains and flows in bidirected graphsKHELLADI, A.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 1, pp 95-115, issn 0095-8956Article

Graphes et hypergraphes de chaînes d'un arbreArami, Zohra; Duchet, Pierre.1987, 80 p.Thesis

Learning AMP chain graphs and some marginal models thereof under faithfulnessPENA, Jose M.International journal of approximate reasoning. 2014, Vol 55, Num 4, pp 1011-1021, issn 0888-613X, 11 p.Conference Paper

RELIABILITY ANALYSIS OF REGULAR DISTRIBUTED CHAIN STRUCTURES.MORGAN RJ; HOLMES WH.1974; I.E.E.E. TRANS. RELIABIL.; U.S.A.; DA. 1974; VOL. 23; NO 1; PP. 11-16; BIBL. 11 REF.Article

A reconstruction algorithm for the essential graphSTUDENY, Milan; VOMLEL, Jirri.International journal of approximate reasoning. 2009, Vol 50, Num 2, pp 385-413, issn 0888-613X, 29 p.Article

A unified approach to the characterization of equivalence classes of DAGs, chain graphs with no flags and chain graphsROVERATO, Alberto.Scandinavian journal of statistics. 2005, Vol 32, Num 2, pp 295-312, issn 0303-6898, 18 p.Article

Wiener, hyper-Wiener, detour and hyper-detour indices of bridge and chain graphsMANSOUR, Toufik; SCHORK, Matthias.Journal of mathematical chemistry. 2010, Vol 47, Num 1, pp 72-98, issn 0259-9791, 27 p.Article

TWO OPERATIONS OF MERGING AND SPLITTING COMPONENTS IN A CHAIN GRAPHSTUDENY, Milan; ROVERATO, Alberto; STEPANOVA, Sarka et al.Kybernetika. 2009, Vol 45, Num 2, pp 208-248, issn 0023-5954, 41 p.Article

Analysis of node energy consumption in sensor networksSCHWIEGER, Katja; NUSZKOWSKI, Heinrich; FETTWEIS, Gerhard et al.Lecture notes in computer science. 2004, pp 94-105, issn 0302-9743, isbn 3-540-20825-9, 12 p.Conference Paper

Decision networksPAWLAK, Zdzisław.Lecture notes in computer science. 2004, pp 1-7, issn 0302-9743, isbn 3-540-22117-4, 7 p.Conference Paper

  • Page / 5