Analysis and design of algorithms for combinatorial problems /

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 mos...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: Istituto di analisi dei sistemi ed informatica (Italy)
Otros Autores: Ausiello, G. (Giorgio), 1941-, Lucertini, M. (Mario)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Amsterdam ; New York : New York, N.Y., U.S.A. : North-Holland ; Sole distributors for the U.S.A. and Canada, Elsevier Science Pub. Co., 1985.
Colección:Annals of discrete mathematics ; 25.
North-Holland mathematics studies ; 109.
Temas:
Combinatorial analysis > Data processing.
Analyse combinatoire > Informatique.
MATHEMATICS > Combinatorics.
Algorithmus
Kombinatorische Analysis
Algoritmos E Estruturas De Dados.
Analise Combinatoria.
Analyse combinatoire > Congr�es.
Algorithmes > Congr�es.
Math�ematiques > Logiciels > Congr�es.
algorithmes > analyse combinatoire > �etudes diverses.
Combinatorial analysis > Algorithms
Acceso en línea:Texto completo
Texto completo
Texto completo
Tabla de Contenidos:
  • Strongly equivalent directed hypergraphs / G. Ausiello. A. d 'Atri and D. Sacc�a
  • A local-ratio theorem for approximating the weighted vertex cover problem / R. Bar Yehuda and S. Even
  • Dynamic programming parallel procedures for SIMD architectures / P. Bertolazzi
  • Simulations among classes of random access machines and equivalence among numbers succinctly represented / A. Bertoni, G. Mauri and N. Sabadini
  • A realistic approach to VLSI relational data-base processing / M.A. Bonucelli [and others]
  • On counting BECS / R Casas, J. D�iaz and M. Verg�es
  • Rigid extensions of graph maps / I.S. Filotti
  • Algebraic methods for trie statistics / Ph. Flajolet, M. Regnier and D. Sotteau
  • Easy solutions for the K-center problem or the dominating set problem on random graphs / D.S. Hochbaum
  • Network design with multiple demand : a new approach / M. Lucertini and G. Paletta
  • How to find long paths efficiently / B. Monien
  • Compact channel routing of multiterminal nets / M. Sarrafzadeh and F.P. Preparata
  • Consistency of quadratic boolean equations and the K�onig-Egerv�ary property for graphs / B. Simeone
  • On some relationships between combinatorics and probabilistic analysis / M. Talamo, A. Marchetti-Spaccamela and M. Protasi
  • A threshold for multiple edge coverings in random hypergraphs / C. Vercellis.

Ejemplares similares