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.
Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman
| Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xii, 326 p. : ill. ; 24 cm |
| Soggetto non controllato |
Combinatorial games
Combinatorics Computability Computing Designs and geometries Domination in graphs Extremal graph theory Graph coloring Graph theory |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0276982 |
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman
| Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / Frederick Hoffman |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xii, 326 p. : ill. ; 24 cm |
| Soggetto topico |
00B25 - Proceedings of conferences of miscellaneous specific interest [MSC 2020]
05-XX - Combinatorics [MSC 2020] 05Cxx - Graph theory [MSC 2020] 68-XX - Computer science [MSC 2020] 68R10 - Graph theory (including graph drawing) in computer science [MSC 2020] |
| Soggetto non controllato |
Combinatorial games
Combinatorics Computability Computing Designs and geometries Domination in graphs Extremal graph theory Graph coloring Graph theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00276982 |
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Geometry, structure and randomness in combinatorics / edited by Jiří Matoušek, Jaroslav Nešetřil, Marco Pellegrini
| Geometry, structure and randomness in combinatorics / edited by Jiří Matoušek, Jaroslav Nešetřil, Marco Pellegrini |
| Pubbl/distr/stampa | Pisa, : Edizioni della Normale, 2014 |
| Descrizione fisica | XIV, 146 p., 1 carta di tav. : ill. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05Cxx - Graph theory [MSC 2020] |
| Soggetto non controllato |
Discrete geometry
Discrete mathematics Extremal graph theory Graph representations Structural graph theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN0104355 |
| Pisa, : Edizioni della Normale, 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Geometry, structure and randomness in combinatorics / edited by Jiří Matoušek, Jaroslav Nešetřil, Marco Pellegrini
| Geometry, structure and randomness in combinatorics / edited by Jiří Matoušek, Jaroslav Nešetřil, Marco Pellegrini |
| Pubbl/distr/stampa | Pisa, : Edizioni della Normale, 2014 |
| Descrizione fisica | XIV, 146 p., 1 carta di tav. : ill. ; 24 cm |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05Cxx - Graph theory [MSC 2020] |
| Soggetto non controllato |
Discrete geometry
Discrete mathematics Extremal graph theory Graph representations Structural graph theory |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Titolo uniforme | |
| Record Nr. | UNICAMPANIA-VAN00104355 |
| Pisa, : Edizioni della Normale, 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Graph and Network Theory : An Applied Approach using Mathematica® / Michael A. Henning, Jan H. van Vuuren
| Graph and Network Theory : An Applied Approach using Mathematica® / Michael A. Henning, Jan H. van Vuuren |
| Autore | Henning, Michael A. |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xxix, 766 p. : ill. ; 24 cm |
| Altri autori (Persone) | Vuuren, Jan H. van |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C90 - Applications of graph theory [MSC 2020] 90-XX - Operations research, mathematical programming [MSC 2020] 90B10 - Deterministic network models in operations research [MSC 2020] |
| Soggetto non controllato |
Algorithmic complexity
Domination in graphs Eulerian graphs Extremal graph theory Graph coloring Graph connectedness Graph theory Hamiltonian graphs Location problems Mathematica exercises Maximum flow networks Minimum spanning trees NP-completeness Network optimisation Optimal paths Oriented graphs Planarity Ramsey theory Zarankiewicz numbers |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN0277578 |
Henning, Michael A.
|
||
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Graph and Network Theory : An Applied Approach using Mathematica® / Michael A. Henning, Jan H. van Vuuren
| Graph and Network Theory : An Applied Approach using Mathematica® / Michael A. Henning, Jan H. van Vuuren |
| Autore | Henning, Michael A. |
| Pubbl/distr/stampa | Cham, : Springer, 2022 |
| Descrizione fisica | xxix, 766 p. : ill. ; 24 cm |
| Altri autori (Persone) | Vuuren, Jan H. van |
| Soggetto topico |
05-XX - Combinatorics [MSC 2020]
05C90 - Applications of graph theory [MSC 2020] 90-XX - Operations research, mathematical programming [MSC 2020] 90B10 - Deterministic network models in operations research [MSC 2020] |
| Soggetto non controllato |
Algorithmic complexity
Domination in graphs Eulerian graphs Extremal graph theory Graph coloring Graph connectedness Graph theory Hamiltonian graphs Location problems Mathematica exercises Maximum flow networks Minimum spanning trees NP-completeness Network optimisation Optimal paths Oriented graphs Planarity Ramsey theory Zarankiewicz numbers |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNICAMPANIA-VAN00277578 |
|
Henning, Michael A.
|
||
| Cham, : Springer, 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Vanvitelli | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910785659103321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt
| Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
| Autore | Mesbahi Mehran |
| Edizione | [STU student edition] |
| Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
| Descrizione fisica | 1 online resource (424 pages) |
| Disciplina | 006.3 |
| Collana | Princeton series in applied mathematics |
| Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
| Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
| ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
| Record Nr. | UNINA-9910816716403321 |
|
Mesbahi Mehran
|
||
| Princeton : , : Princeton University Press, , [2010] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||