Currently displaying 1 – 20 of 28

Showing per page

Order by Relevance | Title | Year of publication

Computational complexity of problems of combinatorics and graph theory

M. M. Sysło — 1980

Mathematica Applicanda

From the introduction: "The present article does not pretend to be a complete survey of all or even of the most important algorithms in combinatorics and graph theory. The algorithms presented illustrate only general considerations involving the computational complexity of problems of combinatorics. It is assumed that the reader is acquainted with the fundamental algorithms of combinatorics and graph theory. The first part of the paper is an outline of basic computation models used in the analysis...

Page 1 Next

Download Results (CSV)