Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph Theory : Proceedings of a Conference held in Lagow, Poland, February 10-13, 1981 / edited by M. Borowiecki, John W. Kennedy and Maciej M. Sysło
| Graph Theory : Proceedings of a Conference held in Lagow, Poland, February 10-13, 1981 / edited by M. Borowiecki, John W. Kennedy and Maciej M. Sysło |
| Pubbl/distr/stampa | Berlin, : Springer, 1983 |
| Descrizione fisica | xii, 292 p. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
00Bxx - Conference proceedings and collections of articles [MSC 2020] 05Cxx - Graph theory [MSC 2020] |
| Soggetto non controllato |
Combinatorics
Graph Graph theory Graphs Hypergraph Lattice Mapping Partition Vertices |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0262733 |
| Berlin, : Springer, 1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Graph Theory : Proceedings of a Conference held in Lagow, Poland, February 10-13, 1981 / edited by M. Borowiecki, John W. Kennedy and Maciej M. Sysło
| Graph Theory : Proceedings of a Conference held in Lagow, Poland, February 10-13, 1981 / edited by M. Borowiecki, John W. Kennedy and Maciej M. Sysło |
| Pubbl/distr/stampa | Berlin, : Springer, 1983 |
| Descrizione fisica | xii, 292 p. ; 24 cm |
| Soggetto topico |
00Bxx - Conference proceedings and collections of articles [MSC 2020]
05-XX - Combinatorics [MSC 2020] 05Cxx - Graph theory [MSC 2020] |
| Soggetto non controllato |
Combinatorics
Graph Graph theory Graphs Hypergraph Lattice Mapping Partition Vertices |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00262733 |
| Berlin, : Springer, 1983 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Simplicial complexes of graphs / Jakob Jonsson
| Simplicial complexes of graphs / Jakob Jonsson |
| Autore | Jonsson, Jakob |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | XIV, 378 p. ; 24 cm |
| Soggetto topico |
05E18 - Group actions on combinatorial structures [MSC 2020]
55U10 - Simplicial sets and complexes in algebraic topology [MSC 2020] 06A11 - Algebraic aspects of posets [MSC 2020] 05E40 - Combinatorial aspects of commutative algebra [MSC 2020] |
| Soggetto non controllato |
Graphs
Homology Homotopy Hypergraph Matching Sim Vertex |
| ISBN | 978-35-407-5858-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0064515 |
Jonsson, Jakob
|
||
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Simplicial complexes of graphs / Jakob Jonsson
| Simplicial complexes of graphs / Jakob Jonsson |
| Autore | Jonsson, Jakob |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | XIV, 378 p. ; 24 cm |
| Soggetto topico |
05E18 - Group actions on combinatorial structures [MSC 2020]
05E40 - Combinatorial aspects of commutative algebra [MSC 2020] 06A11 - Algebraic aspects of posets [MSC 2020] 55U10 - Simplicial sets and complexes in algebraic topology [MSC 2020] |
| Soggetto non controllato |
Graphs
Homology Homotopy Hypergraph Matching Sim Vertex |
| ISBN | 978-35-407-5858-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00064515 |
|
Jonsson, Jakob
|
||
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Theory and Applications of Graphs : Proceedings, Michigan, May 11-15, 1976 / edited by Yousef Alavi and Don R. Lick
| Theory and Applications of Graphs : Proceedings, Michigan, May 11-15, 1976 / edited by Yousef Alavi and Don R. Lick |
| Pubbl/distr/stampa | Berlin, : Springer, 1978 |
| Descrizione fisica | xiv, 638 p. ; 24 cm |
| Soggetto topico |
00Bxx - Conference proceedings and collections of articles [MSC 2020]
05Cxx - Graph theory [MSC 2020] 94Cxx - Circuits, networks [MSC 2020] |
| Soggetto non controllato |
Algorithms
Applications Graph theory Graphs Hypergraph Matching |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0261018 |
| Berlin, : Springer, 1978 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Theory and Applications of Graphs : Proceedings, Michigan, May 11-15, 1976 / edited by Yousef Alavi and Don R. Lick
| Theory and Applications of Graphs : Proceedings, Michigan, May 11-15, 1976 / edited by Yousef Alavi and Don R. Lick |
| Pubbl/distr/stampa | Berlin, : Springer, 1978 |
| Descrizione fisica | xiv, 638 p. ; 24 cm |
| Soggetto topico |
00Bxx - Conference proceedings and collections of articles [MSC 2020]
05Cxx - Graph theory [MSC 2020] 94Cxx - Circuits, networks [MSC 2020] |
| Soggetto non controllato |
Algorithms
Applications Graph theory Graphs Hypergraph Matching |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00261018 |
| Berlin, : Springer, 1978 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.]
| The traveling salesman problem [[electronic resource] ] : a computational study / / David L. Applegate ... [et al.] |
| Autore | Applegate David L |
| Edizione | [Course Book] |
| Pubbl/distr/stampa | Princeton, : Princeton University Press, c2006 |
| Descrizione fisica | 1 online resource (606 p.) |
| Disciplina | 511.6 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico | Traveling salesman problem |
| Soggetto non controllato |
AT&T Labs
Accuracy and precision Addition Algorithm Analysis of algorithms Applied mathematics Approximation algorithm Approximation Basic solution (linear programming) Best, worst and average case Bifurcation theory Big O notation CPLEX CPU time Calculation Chaos theory Column generation Combinatorial optimization Computation Computational resource Computer Connected component (graph theory) Connectivity (graph theory) Convex hull Cutting-plane method Delaunay triangulation Determinism Disjoint sets Dynamic programming Ear decomposition Engineering Enumeration Equation Estimation Euclidean distance Euclidean space Family of sets For loop Genetic algorithm George Dantzig Georgia Institute of Technology Greedy algorithm Hamiltonian path Hospitality Hypergraph Implementation Instance (computer science) Institute Integer Iteration Linear inequality Linear programming Mathematical optimization Mathematics Model of computation Neuroscience Notation Operations research Optimization problem Order by Pairwise Parameter (computer programming) Parity (mathematics) Percentage Polyhedron Polytope Pricing Princeton University Processing (programming language) Project Quantity Reduced cost Requirement Result Rice University Rutgers University Scientific notation Search algorithm Search tree Self-similarity Simplex algorithm Solution set Solver Source code Special case Stochastic Subroutine Subsequence Subset Summation Test set Theorem Theory Time complexity Trade-off Travelling salesman problem Tree (data structure) Upper and lower bounds Variable (computer science) Variable (mathematics) |
| ISBN |
1-283-25611-8
9786613256119 1-4008-4110-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Chapter 1. The Problem -- Chapter 2. Applications -- Chapter 3. Dantzig, Fulkerson, and Johnson -- Chapter 4. History of TSP Computation -- Chapter 5. LP Bounds and Cutting Planes -- Chapter 6. Subtour Cuts and PQ-Trees -- Chapter 7. Cuts from Blossoms and Blocks -- Chapter 8. Combs from Consecutive Ones -- Chapter 9. Combs from Dominoes -- Chapter 10. Cut Metamorphoses -- Chapter 11. Local Cuts -- Chapter 12. Managing the Linear Programming Problems -- Chapter 13. The Linear Programming Solver Chapter 14. Branching -- Chapter 14. Branching -- Chapter 15. Tour Finding -- Chapter 16. Computation -- Chapter 17. The Road Goes On -- Bibliography -- Index |
| Record Nr. | UNINA-9910789748903321 |
|
Applegate David L
|
||
| Princeton, : Princeton University Press, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
VLSI Planarization : Methods, Models, Implementation / by V. Feinberg, A. Levin and E. Rabinovich
| VLSI Planarization : Methods, Models, Implementation / by V. Feinberg, A. Levin and E. Rabinovich |
| Autore | Feĭnberg, Valeriĭ Z. |
| Pubbl/distr/stampa | Dordrecht, : Springer, : Kluwer, 1997 |
| Descrizione fisica | vi, 184 p. ; 24 cm |
| Altri autori (Persone) |
Levin, Andrey G.
Rabinovich, Efim B. |
| Soggetto topico |
68-XX - Computer science [MSC 2020]
68W35 - Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) [MSC 2020] |
| Soggetto non controllato |
Algorithms
Circuits Complexity Complexity theory Computers Developments Graph theory Hypergraph Mathematics VLSI |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00297680 |
|
Feĭnberg, Valeriĭ Z.
|
||
| Dordrecht, : Springer, : Kluwer, 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||