Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Grafo orientado")

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


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 3176

  • Page / 128

Selection :

  • and

Approximation algorithms for Steiner and directed multicutsKLEIN, P. N; PLOTKIN, S. A; RAO, S et al.Journal of algorithms (Print). 1997, Vol 22, Num 2, pp 241-269, issn 0196-6774Article

On the parameterized complexity of layered graph drawingDUJMOVIC, V; FELLOWS, M; WHITESIDES, S et al.Lecture notes in computer science. 2001, pp 488-499, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Exact reliabilities of most reliable double-loop networksHWANG, F. K; WRIGHT, P. E; HU, X. D et al.Networks (New York, NY). 1997, Vol 30, Num 2, pp 81-90, issn 0028-3045Article

Solutions de tournois : Un spicilège = Tournaments solutions : a surveyLASLIER, J.-F.Mathématiques, informatique et sciences humaines. 1996, Num 133, pp 7-22, issn 0995-2314Article

On claws belonging to every tournamentXIAOYUN LU.Combinatorica (Print). 1991, Vol 11, Num 2, pp 173-179, issn 0209-9683Article

Tournois et analyse des préférences ordinalesMathématiques, informatique et sciences humaines. 1996, Num 133, issn 0995-2314, 87 p.Serial Issue

The infinite families of optimal double loop networksLI, Q; XU, J. M; ZHANG, Z. L et al.Discrete applied mathematics. 1993, Vol 46, Num 2, pp 179-183, issn 0166-218XArticle

Semikernels and (k, l)-kernels in digraphsGALEANA-SANCHEZ, H; XUELIANG LI.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 340-346, issn 0895-4801Article

Embedding de Bruijn, Kautz and shuffle-exchange networks in booksHASUNUMA, T; SHIBATA, Y.Discrete applied mathematics. 1997, Vol 78, Num 1-3, pp 103-116, issn 0166-218XArticle

Les graphes 2-reconstructibles indécomposables = The 2-reconstructible indecomposable graphsBOUSSAÏRI, Abderrahim; CHAÏCHAA, Abdelhak.Comptes rendus. Mathématique. 2007, Vol 345, Num 1, pp 1-4, issn 1631-073X, 4 p.Article

The refinement relation of graph-based Generic programsLIEBERHERR, Karl; PATT-SHAMIR, Boaz.Lecture notes in computer science. 2000, pp 40-52, issn 0302-9743, isbn 3-540-41090-2Conference Paper

Universal cycles of k-subsets and k-permutationsJACKSON, B. W.Discrete mathematics. 1993, Vol 117, Num 1-3, pp 141-150, issn 0012-365XArticle

Marches automatiques = Automatic walksDEKKING, F. M.Journal de théorie des nombres de Bordeaux. 1993, Vol 5, Num 1, pp 93-100, issn 1246-7405Article

p-competition numbersSUH-RYUNG KIM; MCKEE, T. A; MCMORRIS, F. R et al.Discrete applied mathematics. 1993, Vol 46, Num 1, pp 87-92, issn 0166-218XArticle

Score sequences of oriented graphsAVERY, P.Journal of graph theory. 1991, Vol 15, Num 3, pp 251-257, issn 0364-9024Article

Locally semicomplete digraphs : a generalizationof tournamentsBANG-JENSEN, J.Journal of graph theory. 1990, Vol 14, Num 3, pp 371-390, issn 0364-9024Article

Packing of two digraphs into a transitive tournamentPILSNIAK, Monika.Discrete mathematics. 2007, Vol 307, Num 7-8, pp 971-974, issn 0012-365X, 4 p.Conference Paper

Contractible subgraphs and morita equivalence of graph C*-algebrasCRISP, Tyrone; GOW, Daniel.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 7, pp 2003-2013, issn 0002-9939, 11 p.Article

Development of hierarchy theory for digraphs using concentration theory based on a new type of Lorenz curveEGGHE, L.Mathematical and computer modelling. 2002, Vol 36, Num 4-5, pp 587-602, issn 0895-7177Article

Calculating a relational program for transitive reductions of strongly connected graphsBERGHAMMER, Rudolf; HOFFMANN, Thorsten.Lecture notes in computer science. 2002, pp 258-275, issn 0302-9743, isbn 3-540-00315-0, 18 p.Conference Paper

On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphsKIKUCHI, Yosuke; SHIBATA, Yukio.Lecture notes in computer science. 2001, pp 400-408, issn 0302-9743, isbn 3-540-42494-6Conference Paper

On the number of descendants in an object DAGSHIDLOVSKY, B; BERTINO, E.Information processing letters. 1996, Vol 58, Num 5, pp 211-216, issn 0020-0190Article

Constructing compact rectilinear planar layouts using canonical representation of planar graphsNUMMENMAA, J.Theoretical computer science. 1992, Vol 99, Num 2, pp 213-230, issn 0304-3975Article

Les graphes critiquement sans duo = Graphs critically without duoBOUDABBOUS, Youssef; SALHI, Abdeljelil.Comptes rendus. Mathématique. 2009, Vol 347, Num 9-10, pp 463-466, issn 1631-073X, 4 p.Article

The categorical product of two 5-chromatic digraphs can be 3-chromaticBESSY, Stéphane; THOMASSE, Stéphan.Discrete mathematics. 2005, Vol 305, Num 1-3, pp 344-346, issn 0012-365X, 3 p.Article

  • Page / 128