Pascal and Francis Bibliographic Databases


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


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 1887

  • Page / 76


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

The complexity of short schedules for UET bipartite graphsBAMPIS, E.RAIRO. Recherche opérationnelle. 1999, Vol 33, Num 3, pp 367-370, issn 0399-0559Article

A selected tour of the theory of identification matricesCHEN, L.Lecture notes in computer science. 1997, pp 222-231, issn 0302-9743, isbn 3-540-63357-XConference Paper

Mutual placement of bipartite graphsFOUQUET, J.-L; PAWEL WOJDA, A.Discrete mathematics. 1993, Vol 121, Num 1-3, pp 85-92, issn 0012-365XConference Paper

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

Exact and Approximate Algorithms for the Most Connected Vertex ProblemCHENG SHENG; YUFEI TAO; JIANZHONG LI et al.ACM transactions on database systems. 2012, Vol 37, Num 2, issn 0362-5915, 12.1-12.39Article

Bipartite subspaces having no bases distinguishable by local operations and classical communicationWATROUS, John.Physical review letters. 2005, Vol 95, Num 8, issn 0031-9007, 080505-1-080505-4Article

The crossing number of K4,n on the real projective planePAK TUNG HO.Discrete mathematics. 2005, Vol 304, Num 1-3, pp 23-33, issn 0012-365X, 11 p.Article

Euler graphs, triangle-free graphs and bipartite graphs in switching classesHAGE, Jurriaan; HARJU, Tero; WELZL, Emo et al.Lecture notes in computer science. 2002, pp 148-160, issn 0302-9743, isbn 3-540-44310-X, 13 p.Conference Paper

Existence de cycles dans les graphes bipartis et dans plusieurs familles de graphes généralisant la classe des graphes sans K1,3 = CYCLES IN BIPARTITE GRAPHS AND SEVERAL FAMILIES THAT GENERALIZE THE CLAW-FREE GRAPHS FAMILYEl Kadi Abderrezzak, Mohamed; Flandrin, Evelyne.1999, 200 p.Thesis

Digital topology on graphsNOGLY, D; SCHLADT, M.Computer vision and image understanding (Print). 1996, Vol 63, Num 2, pp 394-396, issn 1077-3142Article

Improved algorithms for bipartite network flowAHUJA, R. K; ORLIN, J. B; STEIN, C et al.SIAM journal on computing (Print). 1994, Vol 23, Num 5, pp 906-933, issn 0097-5397Article

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

The PI index of product graphsYOUSEFI-AZARI, H; MANOOCHEHRIAN, B; ASHRAFI, A. R et al.Applied mathematics letters. 2008, Vol 21, Num 6, pp 624-627, issn 0893-9659, 4 p.Article

The minimum number of vertices for a triangle-free graph with Χl (G) = 4 is 11BAOYINDURENG WU; LI ZHANG.Discrete mathematics. 2008, Vol 308, Num 23, pp 5342-5348, issn 0012-365X, 7 p.Article

  • Page / 76