Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GAVRIL F")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 19 of 19

  • Page / 1
Export

Selection :

  • and

TESTING FOR EQUALITY BETWEEN MAXIMUM MATCHING AND MINIMUM NODE COVERING.GAVRIL F.1977; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1977; VOL. 6; NO 6; PP. 199-202; BIBL. 5 REF.Article

AN ALGORITHM FOR TESTING CHORDALITY OF GRAPHS.GAVRIL F.1975; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1975; VOL. 3; NO 4; PP. 110-112; BIBL. 2 REF.Article

ALGORITHMS ON CIRCULAR-ARC GRAPHS.GAVRIL F.1974; NETWORKS; U.S.A.; DA. 1974; VOL. 4; NO 4; PP. 357-369; BIBL. 1 P.Article

A RECOGNITION ALGORITHM FOR THE INTERSECTION GRAPHS OF PATHS IN TREESGAVRIL F.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 3; PP. 211-227; BIBL. 12 REF.Article

A RECOGNITION ALGORITHM FOR THE TOTAL GRAPHS.GAVRIL F.1978; NETWORKS; U.S.A.; DA. 1978; VOL. 8; NO 2; PP. 121-133; BIBL. 5 REF.Article

MERGING WITH PARALLEL PROCESSORS.GAVRIL F.1975; COMMUNIC. A.C.M.; U.S.A.; DA. 1975; VOL. 18; NO 10; PP. 588-591; BIBL. 7 REF.; (ACM SIGMOD CONF. MANAGE. DATA; SAN JOSE, CALIF.; 1975)Conference Paper

A RECOGNITION ALGORITHM FOR THE INTERSECTION GRAPHS OF DIRECTED PATHS IN DIRECTED TREES.GAVRIL F.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 13; NO 3; PP. 237-249; BIBL. 11 REF.Article

ALGORITHMS ON CLIQUE SEPARABLE GRAPHS.GAVRIL F.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 19; NO 2; PP. 159-165; BIBL. 7 REF.Article

Maximum weight independent sets and cliques in intersection graphs of filamentsGAVRIL, F.Information processing letters. 2000, Vol 73, Num 5-6, pp 181-188, issn 0020-0190Article

An efficiently solvable graph partition problem to which many problems are reducibleGAVRIL, F.Information processing letters. 1993, Vol 45, Num 6, pp 285-290, issn 0020-0190Article

Algorithms for maximum k-colorings and k-coverings of transitive graphsGAVRIL, F.Networks (New York, NY). 1987, Vol 17, Num 4, pp 465-470, issn 0028-3045Article

CHARACTERIZATION AND ALGORITHMS OF CURVE MAP GRAPHSGAVRIL F; SCHOENHEIM J.1982; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1982; VOL. 4; NO 3; PP. 181-191; BIBL. 6 REF.Article

Generating the maximum spanning trees of a weighted graphGAVRIL, F.Journal of algorithms (Print). 1987, Vol 8, Num 4, pp 592-597, issn 0196-6774Article

EDGE DOMINATING SETS IN GRAPHSYANNAKAKIS M; GAVRIL F.1980; SIAM J. APPL. MATH.; ISSN 0036-1399; USA; DA. 1980; VOL. 38; NO 3; PP. 364-372; BIBL. 13 REF.Article

An algorithm for fraternal orientation of graphsURRUTIA, J; GAVRIL, F.Information processing letters. 1992, Vol 41, Num 5, pp 271-274, issn 0020-0190Article

Constructing trees with prescribed cardinalithies for the components of their vertex deleted subgraphsGAVRIL, F; SCHÖNHEIM, J.Journal of algorithms (Print). 1985, Vol 6, Num 2, pp 239-252, issn 0196-6774Article

Intersection graphs of k-acyclic families of subtrees and relational database query processingGAVRIL, F; SHMUELI, O.Information processing letters. 1998, Vol 66, Num 1, pp 1-6, issn 0020-0190Article

The maximum-k-colorable subgraph problem for chordal graphsYANNAKAKIS, M; GAVRIL, F.Information processing letters. 1987, Vol 24, Num 2, pp 133-137, issn 0020-0190Article

A synthesis of methods for simulating vulnerability of armored vehiclesGAVRIL, F.Naval research logistics. 1995, Vol 42, Num 2, pp 247-265, issn 0894-069XArticle

  • Page / 1