Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Algorithmic aspects of combinatorics

Discrete mathematics --- Combinatorial analysis --- Algorithms. --- Data processing. --- 519.1 --- 681.3*G21 --- 681.3*G21 Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 519.1 Combinatorics. Graph theory --- Combinatorics. Graph theory --- Algorism --- Algebra --- Arithmetic --- Foundations

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Discrete mathematics --- Mathematical optimization --- Combinatorial optimization --- Computational complexity --- Optimisation mathématique --- Optimisation combinatoire --- Complexité de calcul (Informatique) --- Computational Complexity --- 519.1 --- 681.3*G21 --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Complexity, Computational --- Electronic data processing --- Machine theory --- Optimization, Combinatorial --- Combinatorial analysis --- Combinatorics. Graph theory --- Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- Combinatorial optimization. --- Computational complexity. --- Mathematical optimization. --- 681.3*G21 Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 519.1 Combinatorics. Graph theory --- Optimisation mathématique --- Complexité de calcul (Informatique)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Combinatorial problems have been from the very beginning part of the history of mathematics. By the Sixties, the main classes of combinatorial problems had been defined. During that decade, a great number of research contributions in graph theory had been produced, which laid the foundations for most of the research in graph optimization in the following years. During the Seventies, a large number of special purpose models were developed. The impressive growth of this field since has been strongly determined by the demand of applications and influenced by the technological increases in compu

Discrete mathematics --- Combinatorial analysis --- Combinatorial number theory. --- Data processing. --- Data processing --- Number theory --- 519.1 --- 681.3*G21 --- 681.3*G22 --- 519.1 Combinatorics. Graph theory --- Combinatorics. Graph theory --- 681.3*G21 Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 681.3*G22 Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Graph theory: graph algorithms; network problems; path and tree problems; trees--See also {681.3*F22} --- Combinatorial analysis - Data processing

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Matroids --- Computational complexity --- Algorithms --- Network analysis (Planning) --- Combinatorial optimization --- Matroïdes --- Complexité de calcul (Informatique) --- Algorithmes --- Analyse de réseau (Planification) --- Optimisation combinatoire --- Network analysis (planning) --- Computational Complexity --- 519.1 --- 519.8 --- 519.6 --- 681.3*G21 --- 681.3 *G18 --- Project networks --- Planning --- Optimization, Combinatorial --- Combinatorial analysis --- Mathematical optimization --- Combinatorial designs and configurations --- Complexity, Computational --- Electronic data processing --- Machine theory --- Algorism --- Algebra --- Arithmetic --- Combinatorics. Graph theory --- Operational research --- Computational mathematics. Numerical analysis. Computer programming --- Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- Partial differential equations: difference methods; elliptic equations; finite element methods; hyperbolic equations; method of lines; parabolic equations (Numerical analysis) --- Foundations --- Algorithms. --- Combinatorial optimization. --- Computational complexity. --- Matroids. --- Network analysis (Planning). --- 681.3 *G18 Partial differential equations: difference methods; elliptic equations; finite element methods; hyperbolic equations; method of lines; parabolic equations (Numerical analysis) --- 681.3*G21 Combinatorics: combinatorial algorithms; counting problems; generating functions; permutations and combinations; recurrences and difference equations --- 519.6 Computational mathematics. Numerical analysis. Computer programming --- 519.8 Operational research --- 519.1 Combinatorics. Graph theory --- System analysis --- Programmation mathematique --- Combinatoire --- Matroides