Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("PROBLEME NP COMPLET")

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 3351

  • Page / 135
Export

Selection :

  • and

BOUNDING THE BANDWIDTH OF NP-COMPLETE PROBLEMSMONIEN B; SUDBOROUGH IH.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 100; PP. 279-292; BIBL. 15 REF.Conference Paper

DETERMINING THE THICKNESS OF GRAPHS IS NP-HARDMANSFIELD A.1983; MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY; ISSN 0305-0041; GBR; DA. 1983; VOL. 93; NO 1; PP. 9-23; BIBL. 5 REF.Article

A LOWER BOUND FOR ON-LINE BIN PACKINGLIANG FM.1980; INFORM. PROCESSG LETTERS; NLD; DA. 1980; VOL. 10; NO 2; PP. 76-79; BIBL. 2 REF.Article

CROSSING NUMBER IS NP-COMPLETEGAREY MR; JOHNSON DS.1983; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1983; VOL. 4; NO 3; PP. 312-316; BIBL. 5 REF.Article

STEINER MINIMAL TREES ON ZIG-ZAG LINESDU DZ; HWANG FK; WENG JF et al.1983; TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY; ISSN 0002-9947; USA; DA. 1983; VOL. 278; NO 1; PP. 149-156; BIBL. 7 REF.Article

THE COMPLEXITY OF THE PARTIAL ORDER DIMENSION PROBLEMYANNAKAKIS M.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 351-358; BIBL. 19 REF.Article

COMPLEXITE DE L'ARBORICITE LINEAIRE D'UN GRAPHEPEROCHE B.1982; R.A.I.R.O.; ISSN 0399-0559; FRA; DA. 1982; VOL. 16; NO 2; PP. 125-129; ABS. ENG; BIBL. 3 REF.Article

NP COMPLETENESS OF FINDING THE CHROMATIC INDEX OF REGULAR GRAPHSLEVEN D; GALIL Z.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 35-44; BIBL. 5 REF.Article

ON THE COMPLEXITY OF FINDING DEGREE CONSTRAINED SUBGRAPHSPLESNIK J; WAWRUCH A.1982; ACTA MATH. UNIV. COMEN.; ISSN 0231-6986; CSK; DA. 1982; VOL. 40-41; PP. 215-218; ABS. SLO/RUS; BIBL. 9 REF.Article

COMPUTING THE MINIMUM FILL-IN IS NP-COMPLETEYANNAKAKIS M.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 1; PP. 77-79; BIBL. 6 REF.Article

THE NP-COMPLETENESS OF EDGE-COLORINGHOLYER I.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 4; PP. 718-720; BIBL. 4 REF.Article

A NOTE ON SPARSE COMPLETE SETSFORTUNE S.1979; S.I.A.M.J. COMPUTG; USA; DA. 1979; VOL. 8; NO 3; PP. 431-433; BIBL. 5 REF.Article

A note on the generalized due date scheduling problemsSRISKANDARAJAH, C.Naval research logistics. 1990, Vol 37, Num 4, pp 587-597, issn 0894-069X, 11 p.Article

CONCURRENCY CONTROL BY LOCKINGPAPADIMITRIOU CH.1983; SIAM JOURNAL ON COMPUTING; ISSN 0097-5397; USA; DA. 1983; VOL. 12; NO 2; PP. 215-226; BIBL. 22 REF.Article

ON GENERALIZED MATCHING PROBLEMSHELL P; KIRKPATRICK DG.1981; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1981; VOL. 12; NO 1; PP. 33-35; BIBL. 15 REF.Article

POSITIVE FIRST-ORDER LOGIC IS NP-COMPLETEKOZEN D.1981; IBM J. RES. DEVELOP.; ISSN 0018-8646; USA; DA. 1981; VOL. 25; NO 4; PP. 327-332; BIBL. 18 REF.Article

THE NODE-DELETION PROBLEM FOR HEREDITARY PROPERTIES IS NP-COMPLETELEWIS JM; YANNAKAKIS M.1980; J. COMPUTER SYST. SCI.; USA; DA. 1980; VOL. 20; NO 2; PP. 219-230; BIBL. 15 REF.Conference Paper

THE NP-COMPLETENESS OF THE DOMINATING SET PROBLEM IN CUBIC PLANAR GRAPHSKIKUNO T; YOSHIDA N; KAKUDA Y et al.1980; TRANS. INST. ELECTRON. COMMUN. ENG. JPN., E; JPN; DA. 1980; VOL. 63; NO 6; PP. 443-444; BIBL. 7 REF.Article

ON THE COMPLEXITY OF THE GENERAL COLORING PROBLEMMAURER HA; SUDBOROUGH JH; WELZL E et al.1981; INFORMATION AND CONTROL; ISSN 0019-9958; USA; DA. 1981; VOL. 51; NO 2; PP. 128-145; BIBL. 7 REF.Article

THE COMPLEXITY OF SOME PROBLEMS ON SUBSEQUENCES AND SUPERSEQUENCES.MAIER D.1978; J. ASS. COMPUTG MACHIN.; U.S.A.; DA. 1978; VOL. 25; NO 2; PP. 322-336; BIBL. 24 REF.Article

SOME NP-COMPLETE PROBLEMS SIMILAR TO GRAPH ISOMORPHISMLUBIW A.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 1; PP. 11-21; BIBL. 16 REF.Article

THE NP-COMPLETENESS COLUMN: AN ONGOING GUIDEJOHNSON DS.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 4; PP. 393-405; BIBL. 71 REF.Article

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

GRAPH 2-ISOMORPHISM IS NP-COMPLETEYAO FF.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 9; NO 2; PP. 68-72; BIBL. 4 REF.Article

NP-COMPLETENESS OF A FAMILY OF GRAPH-COLOURING PROBLEMSIRVING RW.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 111-117; BIBL. 11 REF.Conference Paper

  • Page / 135