Pascal and Francis Bibliographic Databases


Search results

Your search

kw.\*:("Descomposición 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


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 897

  • Page / 36


Selection :

  • and

Hypergraph decomposition and secret sharingDI CRESCENZO, Giovanni; GALDI, Clemente.Lecture notes in computer science. 2003, pp 645-654, issn 0302-9743, isbn 3-540-20695-7, 10 p.Conference Paper

Non-isomorphic 2-perfect 6-cycle systems of order 13GOWER, R. A. H.Bulletin of the Australian Mathematical Society. 1991, Vol 44, Num 3, pp 381-385, issn 0004-9727Article

List partitions of chordal graphsFEDER, Tomas; HELL, Pavol; KLEIN, Sulamita et al.Lecture notes in computer science. 2004, pp 100-108, issn 0302-9743, isbn 3-540-21258-2, 9 p.Conference Paper

On optimal ear-decompositions of graphsSZIGETI, Z.Lecture notes in computer science. 1999, pp 415-428, issn 0302-9743, isbn 3-540-66019-4Conference Paper

On bounds for the k-partitioning of graphsBEZRUKOV, S. L; ELSÄSSER, R; SCHROEDER, U.-P et al.Lecture notes in computer science. 1999, pp 154-163, issn 0302-9743, isbn 3-540-66200-6Conference Paper

A linear-time algorithm for finding tree-decompositions of small treewidthBODLAENDER, H. L.SIAM journal on computing (Print). 1996, Vol 25, Num 6, pp 1305-1317, issn 0097-5397Article

Using triangles to partition a diskKNOBLAUCH, T.Discrete mathematics. 1990, Vol 84, Num 2, pp 209-211, issn 0012-365XArticle

Decomposition of K13 into a torus graph and a graph imbedded in the Klein bottleBORODIN, O. V; MAYER, J.Discrete mathematics. 1992, Vol 102, Num 1, pp 97-98, issn 0012-365XArticle

A sight-seeing tour of the computational landscape of graph transformationKREOWSKI, Hans-Jörg.Formal and natural computing-eessays dedicated to Grzegorz Rozenberg. Lecture notes in computer science. 2002, pp 119-137, issn 0302-9743, isbn 3-540-43190-XBook Chapter

Sur une propriété des graphes de permutation uniorientables = On a property of uniorientable permutation graphsNOUREDINE BOUAZA.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1995, Vol 320, Num 9, pp 1031-1036, issn 0764-4442Article

Friendship decompositions of graphsSOUSA, Teresa.Discrete mathematics. 2008, Vol 308, Num 15, pp 3352-3360, issn 0012-365X, 9 p.Article

Geometry, Flows, and Graph-Partitioning AlgorithmsARORA, Sanjeev; RAO, Satish; VAZIRANI, Umesh et al.Communications of the ACM. 2008, Vol 51, Num 10, pp 96-105, issn 0001-0782, 10 p.Article

A new algorithm for multi-objective graph partitioningSCHLOEGEL, K; KARYPIS, G; KUMAR, V et al.Lecture notes in computer science. 1999, pp 322-331, issn 0302-9743, isbn 3-540-66443-2Conference Paper

Two packing problems on k-matroid treesGRABLE, D. A.European journal of combinatorics. 1991, Vol 12, Num 4, pp 309-316, issn 0195-6698Article

Analysing Co-evolution among artificial 3D creaturesMICONI, Thomas; CHANNON, Alastair.Lecture notes in computer science. 2006, pp 167-178, issn 0302-9743, isbn 3-540-33589-7, 12 p.Conference Paper

On Indecomposability Preserving Elimination SequencesDUBEY, Chandan K; MEHTA, Shashank K.Lecture notes in computer science. 2006, pp 42-51, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

A multi-level approach for document clusteringOLIVEIRA, Suely; SEOK, Sang-Cheol.Lecture notes in computer science. 2005, pp 204-211, issn 0302-9743, isbn 3-540-26032-3, 3Vol, 8 p.Conference Paper

Pre-processing and linear-decomposition algorithm to solve the k-colorability problemLUCET, Corinne; MENDES, Florence; MOUKRIM, Aziz et al.Lecture notes in computer science. 2004, pp 315-325, issn 0302-9743, isbn 3-540-22067-4, 11 p.Conference Paper

Equitable switching and spectra of graphsTERANISHI, Yasuo.Linear algebra and its applications. 2003, Vol 359, pp 121-131, issn 0024-3795, 11 p.Article

On nesting of G-decompositions of λKv where G has four nonisolated vertices or lessMILICI, Salvatore; QUATTROCCHI, Gaetano.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 297-315, issn 0012-365XConference Paper

Partitioning planar graphs with costs and weightsALEKSANDROV, Lyudmil; DJIDJEV, Hristo; HUA GUO et al.Lecture notes in computer science. 2002, pp 98-110, issn 0302-9743, isbn 3-540-43977-3, 13 p.Conference Paper

Safe reduction rules for weighted treewidthVAN DEN EIJKHOF, Frank; BODLAENDER, Hans L.Lecture notes in computer science. 2002, pp 176-185, issn 0302-9743, isbn 3-540-00331-2, 10 p.Conference Paper

An algorithm for the modular decomposition of hypergraphsBONIZZONI, P; DELLA VEDOVA, G.Journal of algorithms (Print). 1999, Vol 32, Num 2, pp 65-86, issn 0196-6774Article

Partitioning approach to visualization of large graphsBATAGELJ, V; MRVAR, A; ZAVERSNIK, M et al.Lecture notes in computer science. 1999, pp 90-97, issn 0302-9743, isbn 3-540-66904-3Conference Paper

Excluding subdivisions of infinite cliquesROBERTSON, N; SEYMOUR, P. D; THOMAS, R et al.Transactions of the American Mathematical Society. 1992, Vol 332, Num 1, pp 211-223, issn 0002-9947Article

  • Page / 36