An efficient parallel algorithm for shifting the root of a depth first spanning treeTIWARI, P.Journal of algorithms (Print). 1986, Vol 7, Num 1, pp 105-119, issn 0196-6774Article

On the complexity of circulationsARKIN, E. M; PAPADIMITRIOU, C. H.Journal of algorithms (Print). 1986, Vol 7, Num 1, pp 134-145, issn 0196-6774Article

La calcul des circuits électriques par la méthode des graphes non dirigésKLIMENKO, O. A.Elektromehanika. 1984, Num 10, pp 111-112, issn 0136-3360Article

Approximating the minimum k-way cut in a graph via minimum 3-way cutsLIANG ZHAO; NAGAMOCHI, Hiroshi; IBARAKI, Toshihide et al.Journal of combinatorial optimization. 2001, Vol 5, Num 4, pp 397-410, issn 1382-6905Article

Large graphs with given degree and diameterDELORME, C; FARHI, G.IEEE transactions on computers. 1984, Vol 33, Num 9, pp 857-860, issn 0018-9340Article

On the Price of Stability for Designing Undirected Networks with Fair Cost AllocationsFIAT, Amos; KAPLAN, Haim; LEVY, Meital et al.Lecture notes in computer science. 2006, pp 608-618, issn 0302-9743, isbn 3-540-35904-4, 11 p.Conference Paper

On the recognition of P₄-comparability graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2002, pp 355-366, issn 0302-9743, isbn 3-540-00331-2, 12 p.Conference Paper

The indivisibility of the homogeneous K_n-free graphsEL-ZAHAR, M; SAUER, N.Journal of combinatorial theory. Series B. 1989, Vol 47, Num 2, pp 162-170, issn 0095-8956, 9 p.Article

An upper bound for the shortest Hamiltonian path in the symmetric euclidean caseTOMESCU, I.RAIRO. Recherche opérationnelle. 1983, Vol 17, Num 3, pp 297-306, issn 0399-0559Article

Vector representations of graphsPARSONS, T. D; PISANSKI, T.Discrete mathematics. 1989, Vol 78, Num 1-2, pp 143-154, issn 0012-365X, 12 p.Article

An algorithm for the Steiner problem in graphsBEASLEY, J. E.Networks (New York, NY). 1984, Vol 14, Num 1, pp 147-159, issn 0028-3045Article

Isometric embeddings of graphsGRAHAM, R. L; WINKLER, P. M; ULAM, S. M et al.Proceedings of the National Academy of Sciences of the United States of America. Physical sciences. 1984, Vol 81, Num 22, pp 7259-7260, issn 0273-1142Article

An optimal parallel processor bound in strong orientation of an undirected graphYUNG HYANG TSIN.Information processing letters. 1985, Vol 20, Num 3, pp 143-146, issn 0020-0190Article

Constructing the visibility graph for n-line segments in O(n²) timeWELZL, E.Information processing letters. 1985, Vol 20, Num 4, pp 167-171, issn 0020-0190Article

Parallel strong orientation of an undirected graphATALLAH, M. J.Information processing letters. 1984, Vol 18, Num 1, pp 37-39, issn 0020-0190Article

A successful algorithm for the undirected Hamiltonian path problemTHOMPSON, G. L; SINGHAL, S.Discrete applied mathematics. 1985, Vol 10, Num 2, pp 179-185, issn 0166-218XArticle

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

Sur quelques applications du parcours en profondeur dans les graphes = On some applications of the advancing in depth in graphsHAMROUN, Mohammed.1985, [90] fThesis

Probablistic partitioning algorithms for the rectilinear Steiner problemKOMLOS, J; SHING, M. T.Networks (New York, NY). 1985, Vol 15, Num 4, pp 413-423, issn 0028-3045Article

Ramsey numbers and an approximation algorithm for the vertex cover problemMONIEN, B; SPECKENMEYER, E.Acta informatica. 1985, Vol 22, Num 1, pp 115-123, issn 0001-5903Article

Improved dynamic programming algorithms for bandwidth minimization and the Mincut Linear Arrangement problemGURARI, E. M; SUDBOROUGH, I. H.Journal of algorithms (Print). 1984, Vol 5, Num 4, pp 531-546, issn 0196-6774Article

Bounds on the number of eulerian orientationsSCHRIJVER, A.Combinatorica (Print). 1983, Vol 3, Num 3-4, pp 375-380, issn 0209-9683Article

The complexity of determining a shortest cycle of even lengthMONIEN, B.Computing (Wien. Print). 1983, Vol 31, Num 4, pp 355-369, issn 0010-485XArticle

A compilation of relations between graph invariantsBRIGHAM, R. C; DUTTON, R. D.Networks (New York, NY). 1985, Vol 15, Num 1, pp 73-107, issn 0028-3045Article

On distance-transitive graphsWEISS, R.Bulletin of the London Mathematical Society. 1985, Vol 17, Num 66, pp 253-256, issn 0024-6093Article