Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Algorithme polynomial")

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 615

  • Page / 25
Export

Selection :

  • and

Un algorithme polynomial pour reconnaître les graphes d'alternance = A polynomial algorithm for recognizing circle graphsBOUCHET, A; NIVAT, M.Comptes rendus des séances de l'Académie des sciences. Série 1, Mathématique. 1985, Vol 300, Num 16, pp 569-572, issn 0249-6291Article

Domination, independent domination, and duality in strongly chordal graphsFARBER, M.Discrete applied mathematics. 1984, Vol 7, Num 2, pp 115-130, issn 0166-218XArticle

A two-phase algorithm for solving a class of hard satisfiability problemsWARNERS, J. P; VAN MAAREN, H.Operations research letters. 1998, Vol 23, Num 3-5, pp 81-88, issn 0167-6377Article

On the average length of lexicographic pathsBALINSKI, M. L; LIEBLING, T. M; NOBS, A.-E et al.Mathematical programming. 1986, Vol 35, Num 3, pp 362-364, issn 0025-5610Article

Optimal attack and reinforcement of a networkCUNNINGHAM, W. H.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 3, pp 549-561, issn 0004-5411Article

A polynomial algorithm for the min-cut linear arrangement of treesYANNAKAKIS, M.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 4, pp 950-988, issn 0004-5411Article

A generalized uniform processor systemISHII, H; MARTEL, C; MASUDA, T et al.Operations research. 1985, Vol 33, Num 2, pp 346-362, issn 0030-364XArticle

Fractional covers for forests and matchingsPADBERG, M. W; WOLSEY, L. A.Mathematical programming. 1984, Vol 29, Num 1, pp 1-14, issn 0025-5610Article

Polynomial testing of the query «is ab>cd?» with application to finding a minimal cost reliability ratio spanning treeCHANDRASEKARAN, R; TAMIR, A.Discrete applied mathematics. 1984, Vol 9, Num 2, pp 117-123, issn 0166-218XArticle

Heuristics for finding a maximum number of disjoint bounded pathsRONEN, D; PERL, Y.Networks (New York, NY). 1984, Vol 14, Num 4, pp 531-544, issn 0028-3045Article

On dart-free perfectly contractile graphsLINHARES SALES, Claudia; MAFFRAY, Frédéric.Theoretical computer science. 2004, Vol 321, Num 2-3, pp 171-194, issn 0304-3975, 24 p.Article

Polynomial time algorithms for the MIN CUT problem on degree restricted treesMOON-JUNG CHUNG; MAKEDON, F; SUDBOROUGH, I. H et al.SIAM journal on computing (Print). 1985, Vol 14, Num 1, pp 158-177, issn 0097-5397Article

Minimum path basesHARTVIGSEN, D.Journal of algorithms (Print). 1993, Vol 15, Num 1, pp 125-142, issn 0196-6774Article

The travelling salesman problem in graphs with 3 edge cutsetsCORNUEJOLS, G; NADDEF, D; RULLEYBLANK, W et al.Journal of the Association for Computing Machinery. 1985, Vol 32, Num 2, pp 383-410, issn 0004-5411Article

Aspects quantitatifs de Stellensätze et algorithmes de multiplicativité des sommes de carrésSimon Hamon, Odile; Mahe, Louis.1987, 104 p.Thesis

WIELOMIANOWE I PSEUDOWIELOMIANOWE ALGORYTMY ROZWIAZYWANIA PROBLEMOW KOMBINATORYCZNYCH = ALGORITHMES POLYNOMIAUX ET PSEUDOPOLYNOMIAUX POUR RESOUDRE DES PROBLEMES COMBINATOIRESBLAZEWICZ J.1980; ARCH. AUTOM. TELEMECH.; ISSN 0004-072X; POL; DA. 1980; VOL. 25; NO 3; PP. 355-366; ABS. RUS/ENG; BIBL. 14 REF.Article

ALGEBRAIC EPSILON K-ASSIGNMENT PROBLEMSGRYGIEL G.1981; CONTROL CYBERN.; ISSN 0324-8569; POL; DA. 1981; VOL. 10; NO 3-4; PP. 155-165; ABS. POL/RUS; BIBL. 8 REF.Article

POLYNOMIAL ALGORITHM TO RECOGNIZE A MEYNIEL GRAPH = ALGORITHME POLYNOMIAL POUR RECONNAITRE UN GRAPHE DE MEYNIELBURLET M; FONLUPT J.1982; ; FRA; GRENOBLE: I.M.A.G.; DA. 1982; IMAG/RR-303; 35 P.; 30 CM; ABS. FRE; BIBL. 14 REF.;[RAPP. RECH.-LAB. INF. MATH. APPL. GRENOBLE; VOL. RR 303]Report

An improvement to an alternate algorithm for computing Adomian polynomials in special casesBIAZAR, J; ILIE, M; KHOSHKENAR, A et al.Applied mathematics and computation. 2006, Vol 173, Num 1, pp 582-592, issn 0096-3003, 11 p.Article

A very elementary presentation of the Hannenhalli-Pevzner theoryBERGERON, Anne.Discrete applied mathematics. 2005, Vol 146, Num 2, pp 134-145, issn 0166-218X, 12 p.Conference Paper

Stable partitions with W-preferencesCECHLAROVA, Katarina; HAIDUKOVA, Jana.Discrete applied mathematics. 2004, Vol 138, Num 3, pp 333-347, issn 0166-218X, 15 p.Article

A shifting algorithm for continuous tree partitioningBECKER, Ronald; SIMEONE, Bruno; CHIANG, Yen-I et al.Theoretical computer science. 2002, Vol 282, Num 2, pp 353-380, issn 0304-3975Conference Paper

On the complexity of colouring by vertex-transitive and arc-transitive digraphsMACGILLIVRAY, G.SIAM journal on discrete mathematics (Print). 1991, Vol 4, Num 3, pp 397-408, issn 0895-4801Article

The real truth about star designsHOFFMAN, D. G.Discrete mathematics. 2004, Vol 284, Num 1-3, pp 177-180, issn 0012-365X, 4 p.Article

Augmenting graphs for independent setsALEKSEEV, Vladimir E; LOZIN, Vadim V.Discrete applied mathematics. 2004, Vol 145, Num 1, pp 3-10, issn 0166-218X, 8 p.Conference Paper

  • Page / 25