Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Grafo bipartido")

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 1230

  • Page / 50
Export

Selection :

  • and

Bi-complement reducible graphsGIAKOUMAKIS, V; VANHERPE, J.-M.Advances in applied mathematics (Print). 1997, Vol 18, Num 4, pp 389-402, issn 0196-8858Article

Effect of attachment strategies on bipartite networksGANGULY, Niloy; SAHA, Sudipta; MAITI, Abyayananda et al.The European physical journal. B, Condensed matter physics (Print). 2013, Vol 86, Num 6, issn 1434-6028, 86287.1-86287.8Article

A self-stabilizing algorithm for coloring bipartite graphsSUMIT SUR; SRIMANI, P. K.Information sciences. 1993, Vol 69, Num 3, pp 219-227, issn 0020-0255Article

Strongly stable matchings in time O(nm) and extension to the hospitals-residents problemKAVITHA, Telikepalli; MEHLHORN, Kurt; MICHAIL, Dimitrios et al.Lecture notes in computer science. 2004, pp 222-233, issn 0302-9743, isbn 3-540-21236-1, 12 p.Conference Paper

Efficient parallel algorithms for doubly convex-bipartite graphsYU, C.-W; CHEN, G.-H.Theoretical computer science. 1995, Vol 147, Num 1-2, pp 249-265, issn 0304-3975Article

Very fast instances for concept generationBERRY, Anne; MCCONNELL, Ross M; SIGAYRET, Alain et al.Lecture notes in computer science. 2006, pp 119-129, issn 0302-9743, isbn 3-540-32203-5, 1Vol, 11 p.Conference Paper

The hamiltonicity of bipartite graphs involving neighborhood unionsGUANTAO CHEN; SAITO, Akira; BING WEI et al.Discrete mathematics. 2002, Vol 249, Num 1-3, pp 45-56, issn 0012-365XConference Paper

Global price updates helpGOLDBERG, A. V; KENNEDY, R.SIAM journal on discrete mathematics (Print). 1997, Vol 10, Num 4, pp 551-572, issn 0895-4801Article

Applying Lehman's theorems to packing problemsSHEPHERD, F. B.Mathematical programming. 1995, Vol 71, Num 3, pp 353-367, issn 0025-5610Article

Optimal path cover problem on block graphs and bipartite permutation graphsSRIKANT, R; RAVI SUNDARAM; KARAN SHER SINGH et al.Theoretical computer science. 1993, Vol 115, Num 2, pp 351-357, issn 0304-3975Article

Ramsey functions involving Km,n with n largeYUSHENG LI; XUEQING TANG; WENAN ZANG et al.Discrete mathematics. 2005, Vol 300, Num 1-3, pp 120-128, issn 0012-365X, 9 p.Article

Delta matroids whose fundamental graphs are bipartiteDUCHAMP, A.Linear algebra and its applications. 1992, Vol 160, pp 99-112, issn 0024-3795Article

Topological aspects of edge fusions in 4-graphsFERRI, M; LINS, S.Journal of combinatorial theory. Series B. 1991, Vol 51, Num 2, pp 227-243, issn 0095-8956Article

On the Bipartite Unique Perfect Matching ProblemTHANH MINH HOANG; MAHAJAN, Meena; THIERAUF, Thomas et al.Lecture notes in computer science. 2006, pp 453-464, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Ideal binary clutters, connectivity, and A conjecture of SeymourCORNUEJOLS, Gérard; GUENIN, Bertrand.SIAM journal on discrete mathematics (Print). 2002, Vol 15, Num 3, pp 329-352, issn 0895-4801Article

Fractional lengths and crossing numbersSYKORA, Ondrej; SZEKELY, Laszlo A; VRT'O, Imrich et al.Lecture notes in computer science. 2002, pp 186-192, issn 0302-9743, isbn 3-540-00158-1, 7 p.Conference Paper

Kings in k-partite tournamentsPETROVIC, V; THOMASSEN, C.Discrete mathematics. 1991, Vol 98, Num 3, pp 237-238, issn 0012-365XArticle

Competitors' communities and taxonomy of products according to export fluxesCRISTELLI, M; TACCHELLA, A; GABRIELLI, A et al.The European physical journal. Special topics. 2012, Vol 212, pp 115-120, issn 1951-6355, 6 p.Article

Star-factors and k-bounded total dominationGUNTHER, G; HARTNELL, B; RALL, D et al.Networks (New York, NY). 1996, Vol 27, Num 3, pp 197-201, issn 0028-3045Article

Prime-magic labelings of Kn,nBACA, M; HOLLÄNDER, I.Journal of the Franklin Institute. 1990, Vol 327, Num 6, pp 923-926, issn 0016-0032Article

Characterizing minimally n-extendable bipartite graphsDINGJUN LOU.Discrete mathematics. 2008, Vol 308, Num 11, pp 2269-2272, issn 0012-365X, 4 p.Article

Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation : Foundations of computer scienceHAMANE, Ryoso; ITOH, Toshiya.IEICE transactions on information and systems. 2008, Vol 91, Num 2, pp 187-199, issn 0916-8532, 13 p.Article

Modelling disease outbreaks in realistic urban social networksEUBANK, Stephen; GUCLU, Hasan; KUMAR, V. S et al.Nature (London). 2004, Vol 429, Num 6988, pp 180-184, issn 0028-0836, 5 p.Article

Recognizing quasi-triangulated graphsSPINRAD, Jeremy P.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 203-213, issn 0166-218X, 11 p.Conference Paper

A simple algorithm for edge-coloring bipartite multigraphsALON, Noga.Information processing letters. 2003, Vol 85, Num 6, pp 301-302, issn 0020-0190, 2 p.Article

  • Page / 50