Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Cadena grafo")

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

Author Country

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

Results 1 to 25 of 71

  • Page / 3
Export

Selection :

  • and

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

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

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 les graphes - Coloration de graphes = Existence of cycles and paths in graphs - Colorings of graphsHarkat Benhamdine, Amel; Li, Hao.1997, 154 p.Thesis

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

Alternative Markov properties for chain graphsANDERSSON, Steen A; MADIGAN, David; PERLMAN, Michael D et al.Scandinavian journal of statistics. 2001, Vol 28, Num 1, pp 33-85, issn 0303-6898Article

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

Arbres et largeur linéaire des graphes = Trees and Pathwidth of graphsIkorong Annouk, Gilbert; Duchet, Pierre.1992, 119 p.Thesis

When do short cycles generate the cycle space?HARTVIGSEN, D; MARDON, R.Journal of combinatorial theory. Series B. 1993, Vol 57, Num 1, pp 88-99, issn 0095-8956Article

Capacitated, balanced, sequential location-allocation problems on chains and treesSHERALI, H. D.Mathematical programming. 1991, Vol 49, Num 3, pp 381-396, issn 0025-5610Article

Learning causal structures based on Markov equivalence classHE, Yang-Bo; ZHI GENG; XUN LIANG et al.Lecture notes in computer science. 2005, pp 92-106, issn 0302-9743, isbn 3-540-29242-X, 1Vol, 15 p.Conference Paper

Optimal layouts on a chain ATM networkGERSTEL, O; WOOL, A; ZAKS, S et al.Discrete applied mathematics. 1998, Vol 83, Num 1-3, pp 157-178, issn 0166-218XArticle

On the Markov equivalence of chain graphs, undirected graphs, and acyclic digraphsANDERSSON, S. A; MADIGAN, D; PERLMAN, M. D et al.Scandinavian journal of statistics. 1997, Vol 24, Num 1, pp 81-102, issn 0303-6898Article

Lower bounds on universal traversal sequences based on chains of length fiveBUSS, J; TOMPA, M.Information and computation (Print). 1995, Vol 120, Num 2, pp 326-329, issn 0890-5401Article

Marginal AMP chain graphsPENA, Jose M.International journal of approximate reasoning. 2014, Vol 55, Num 5, pp 1185-1206, issn 0888-613X, 22 p.Article

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

Conditional independence and chain event graphsSMITH, Jim Q; ANDERSON, Paul E.Artificial intelligence. 2008, Vol 172, Num 1, pp 42-68, issn 0004-3702, 27 p.Article

Inferring the interactions in complex manufacturing processes using graphical modelsZENG, Li; ZHOU, Shiyu.Technometrics. 2007, Vol 49, Num 4, pp 373-381, issn 0040-1706, 9 p.Article

Interprocedural slicing of multithreaded programs with applications to javaMANGALA GOWRI NANDA; RAMESH, S.ACM transactions on programming languages and systems. 2006, Vol 28, Num 6, pp 1088-1144, issn 0164-0925, 57 p.Article

Partial inversion for linear systems and partial closure of independence graphsWERMUTH, N; WIEDENBECK, M; COX, D. R et al.BIT (Nordisk Tidskrift for Informationsbehandling). 2006, Vol 46, Num 4, pp 883-901, issn 0006-3835, 19 p.Article

Chain polynomials of graphsREAD, Ronald C.Discrete mathematics. 2003, Vol 265, Num 1-3, pp 213-235, issn 0012-365X, 23 p.Article

A robust simulated annealing based examination timetabling systemTHOMPSON, J. M; DOWSLAND, K. A.Computers & operations research. 1998, Vol 25, Num 7-8, pp 637-648, issn 0305-0548Article

Identification of probabilistic graphical network model for root-cause diagnosis in industrial processesMORI, Junichi; MAHALEC, Vladimir; JIE YU et al.Computers & chemical engineering. 2014, Vol 71, pp 171-209, issn 0098-1354, 39 p.Article

On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation AlgorithmsPASQUALETTI, Fabio; FRANCHI, Antonio; BULLO, Francesco et al.IEEE transactions on robotics. 2012, Vol 28, Num 3, pp 592-606, issn 1552-3098, 15 p.Article

  • Page / 3