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.
Algebraic graph theory [[electronic resource] ] : morphisms, monoids, and matrices / / by Ulrich Knauer
| Algebraic graph theory [[electronic resource] ] : morphisms, monoids, and matrices / / by Ulrich Knauer |
| Autore | Knauer U. <1942-> |
| Pubbl/distr/stampa | Berlin ; ; Boston, : De Gruyter, c2011 |
| Descrizione fisica | 1 online resource (324 p.) |
| Disciplina | 511/.5 |
| Collana | De Gruyter studies in mathematics |
| Soggetto topico |
Graph theory
Algebraic topology |
| Soggetto non controllato |
Algebra
Graph Theory Matrices Monoids Morphisms |
| ISBN |
1-283-40044-8
9786613400444 3-11-025509-X |
| Classificazione | SK 890 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface -- Contents -- Chapter 1. Directed and undirected graphs -- Chapter 2. Graphs and matrices -- Chapter 3. Categories and functors -- Chapter 4. Binary graph operations -- Chapter 5. Line graph and other unary graph operations -- Chapter 6. Graphs and vector spaces -- Chapter 7. Graphs, groups and monoids -- Chapter 8. The characteristic polynomial of graphs -- Chapter 9. Graphs and monoids -- Chapter 10. Compositions, unretractivities and monoids -- Chapter 11. Cayley graphs of semigroups -- Chapter 12. Vertex transitive Cayley graphs -- Chapter 13. Embeddings of Cayley graphs - genus of semigroups -- Bibliography -- Index -- Index of symbols |
| Record Nr. | UNINA-9910781751803321 |
Knauer U. <1942->
|
||
| Berlin ; ; Boston, : De Gruyter, c2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algebraic graph theory : morphisms, monoids, and matrices / / by Ulrich Knauer
| Algebraic graph theory : morphisms, monoids, and matrices / / by Ulrich Knauer |
| Autore | Knauer U. <1942-> |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Berlin ; ; Boston, : De Gruyter, c2011 |
| Descrizione fisica | 1 online resource (324 p.) |
| Disciplina |
511/.5
511.5 |
| Collana | De Gruyter studies in mathematics |
| Soggetto topico |
Graph theory
Algebraic topology |
| Soggetto non controllato |
Algebra
Graph Theory Matrices Monoids Morphisms |
| ISBN |
1-283-40044-8
9786613400444 3-11-025509-X |
| Classificazione | SK 890 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Preface -- Contents -- Chapter 1. Directed and undirected graphs -- Chapter 2. Graphs and matrices -- Chapter 3. Categories and functors -- Chapter 4. Binary graph operations -- Chapter 5. Line graph and other unary graph operations -- Chapter 6. Graphs and vector spaces -- Chapter 7. Graphs, groups and monoids -- Chapter 8. The characteristic polynomial of graphs -- Chapter 9. Graphs and monoids -- Chapter 10. Compositions, unretractivities and monoids -- Chapter 11. Cayley graphs of semigroups -- Chapter 12. Vertex transitive Cayley graphs -- Chapter 13. Embeddings of Cayley graphs - genus of semigroups -- Bibliography -- Index -- Index of symbols |
| Record Nr. | UNINA-9910818349703321 |
|
Knauer U. <1942->
|
||
| Berlin ; ; Boston, : De Gruyter, c2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Borrowed knowledge [[electronic resource] ] : chaos theory and the challenge of learning across disciplines / / Stephen H. Kellert
| Borrowed knowledge [[electronic resource] ] : chaos theory and the challenge of learning across disciplines / / Stephen H. Kellert |
| Autore | Kellert Stephen H |
| Pubbl/distr/stampa | Chicago, : University of Chicago Press, 2008 |
| Descrizione fisica | 1 online resource (303 p.) |
| Disciplina | 003/.857 |
| Soggetto topico |
Chaotic behavior in systems
Science - Philosophy Interdisciplinary approach to knowledge |
| Soggetto non controllato | chaos theory, learning, intellectual, teaching, interdisciplinary, academic, scholarly, knowledge, research, natural sciences, anthropology, methodological, methodology, disciplines, academia, aesthetics, science, culture, cultural, debate, controversy, chaotic, philosophy, pluralism, metaphor, intervention, postmodern, contemporary, 20th century |
| ISBN |
1-282-07036-3
9786612070365 0-226-42980-6 |
| Classificazione | SK 890 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Acknowledgments -- 1. What Was Chaos Theory, and Why Would People Want to Borrow It? -- 2. Disciplinary Pluralism -- 3. The Rhetorical Functions of Borrowing and the Uses of Disciplinary Prestige -- 4. Motivating Methodological Change -- 5. Metaphorical Chaos -- 6. How to Criticize a Metaphor -- 7. Facts, Values, and Intervention -- 8. Beautiful Chaos? -- 9. Postmodern Chaos and the Challenge of Pluralism -- Notes -- Works Cited -- Index |
| Record Nr. | UNINA-9910777759303321 |
|
Kellert Stephen H
|
||
| Chicago, : University of Chicago Press, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Borrowed knowledge : chaos theory and the challenge of learning across disciplines / / Stephen H. Kellert
| Borrowed knowledge : chaos theory and the challenge of learning across disciplines / / Stephen H. Kellert |
| Autore | Kellert Stephen H |
| Edizione | [1st ed.] |
| Pubbl/distr/stampa | Chicago, : University of Chicago Press, 2008 |
| Descrizione fisica | 1 online resource (303 p.) |
| Disciplina | 003/.857 |
| Soggetto topico |
Chaotic behavior in systems
Science - Philosophy Interdisciplinary approach to knowledge |
| ISBN |
1-282-07036-3
9786612070365 0-226-42980-6 |
| Classificazione | SK 890 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Frontmatter -- Contents -- Acknowledgments -- 1. What Was Chaos Theory, and Why Would People Want to Borrow It? -- 2. Disciplinary Pluralism -- 3. The Rhetorical Functions of Borrowing and the Uses of Disciplinary Prestige -- 4. Motivating Methodological Change -- 5. Metaphorical Chaos -- 6. How to Criticize a Metaphor -- 7. Facts, Values, and Intervention -- 8. Beautiful Chaos? -- 9. Postmodern Chaos and the Challenge of Pluralism -- Notes -- Works Cited -- Index |
| Record Nr. | UNINA-9910815865203321 |
|
Kellert Stephen H
|
||
| Chicago, : University of Chicago Press, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial optimization and theoretical computer science [[electronic resource] ] : interfaces and perspectives : 30th anniversary of the LAMSADE / / edited by Vangelis Th. Paschos
| Combinatorial optimization and theoretical computer science [[electronic resource] ] : interfaces and perspectives : 30th anniversary of the LAMSADE / / edited by Vangelis Th. Paschos |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (518 p.) |
| Disciplina |
519.6/4
519.64 |
| Altri autori (Persone) | PaschosVangelis Th |
| Collana | ISTE |
| Soggetto topico |
Combinatorial optimization - Computer programs
Computer science - Mathematics |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-282-16499-6
9786612164996 0-470-61109-X 0-470-39367-X |
| Classificazione |
SK 890
ST 130 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; 1.1. Introduction; 1.2. Problem MinMax(1|prec|fmax, θ ); 1.2.1. Uncertainty on due dates; 1.2.2. Uncertainty on processing times and due dates; 1.3. Problem MinMax(1|| Σ wj Cj, Wj ); 1.4. Problem MinMax(1|| Σ Uj, θ ); 1.4.1. Uncertainty on due dates; 1.4.2. Uncertainty on processing times; 1.5. Bibliography; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); 2.1. Introduction
2.1.1. The traveling salesman problem2.1.2. Multi-criteria optimization; 2.1.3. Organization of the chapter; 2.2. Overview; 2.3. The bicriteria TSP(1, 2); 2.3.1. Simple examples of the non-approximability; 2.3.2. A local search heuristic for the bicriteria TSP(1, 2); 2.3.3. A nearest neighbor heuristic for the bicriteria TSP(1, 2); 2.3.4. On the bicriteria Max TSP(1, 2); 2.4. k-criteria TSP(1, 2); 2.4.1. Non-approximability related to the number of generated solutions; 2.4.2. A nearest neighbor heuristic for the k-criteria TSP(1, 2); 2.5. Conclusion; 2.6. Bibliography Chapter 3. Online Models for Set-covering: The Flaw of Greediness3.1. Introduction; 3.2. Description of the main results and related work; 3.3. The price of ignorance; 3.4. Competitiveness of TAKE-ALL and TAKE-AT-RANDOM; 3.4.1. TAKE-ALL algorithm; 3.4.2. TAKE-AT-RANDOM algorithm; 3.5. The nasty flaw of greediness; 3.6. The power of look-ahead; 3.7. The maximum budget saving problem; 3.8. Discussion; 3.9. Bibliography; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; 4.1. Introduction; 4.2. Time Petri nets and timed automata 4.2.1. Timed transition systems and equivalence relations4.2.2. Time Petri nets; 4.2.3. Timed automata; 4.2.4. Expressiveness and equivalence problems; 4.3. Comparison of semantics I, A and PA; 4.3.1. A first comparison between the different semantics of TPNs; 4.3.2. A second comparison for standard bounded TPN; 4.4. Strict ordering results; 4.5. Equivalence with respect to timed language acceptance; 4.5.1. Encoding atomic constraints; 4.5.2. Resetting clocks; 4.5.3. The complete construction; 4.5.4. Δ (A) and A accept the same timed language; 4.5.5. Consequences of the previous results 4.6. Bisimulation of TA by TPNs4.6.1. Regions of a timed automaton; 4.6.2. From bisimulation to uniform bisimulation; 4.6.3. A characterization of bisimilarity; 4.6.4. Proof of necessity; 4.6.5. First construction; 4.6.6. Second construction; 4.6.7. Complexity results; 4.7. Conclusion; 4.8. Bibliography; Chapter 5. A "Maximum Node Clustering" Problem; 5.1. Introduction; 5.2. Approximation algorithm for the general problem; 5.3. The tree case; 5.3.1. Dynamic programming; 5.3.2. A fully polynomial time approximation scheme; 5.4. Exponential algorithms for special cases; 5.5. Bibliography Chapter 6. The Patrolling Problem: Theoretical and Experimental Results |
| Record Nr. | UNINA-9910139491403321 |
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial optimization and theoretical computer science [[electronic resource] ] : interfaces and perspectives : 30th anniversary of the LAMSADE / / edited by Vangelis Th. Paschos
| Combinatorial optimization and theoretical computer science [[electronic resource] ] : interfaces and perspectives : 30th anniversary of the LAMSADE / / edited by Vangelis Th. Paschos |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (518 p.) |
| Disciplina |
519.6/4
519.64 |
| Altri autori (Persone) | PaschosVangelis Th |
| Collana | ISTE |
| Soggetto topico |
Combinatorial optimization - Computer programs
Computer science - Mathematics |
| ISBN |
1-282-16499-6
9786612164996 0-470-61109-X 0-470-39367-X |
| Classificazione |
SK 890
ST 130 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; 1.1. Introduction; 1.2. Problem MinMax(1|prec|fmax, θ ); 1.2.1. Uncertainty on due dates; 1.2.2. Uncertainty on processing times and due dates; 1.3. Problem MinMax(1|| Σ wj Cj, Wj ); 1.4. Problem MinMax(1|| Σ Uj, θ ); 1.4.1. Uncertainty on due dates; 1.4.2. Uncertainty on processing times; 1.5. Bibliography; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); 2.1. Introduction
2.1.1. The traveling salesman problem2.1.2. Multi-criteria optimization; 2.1.3. Organization of the chapter; 2.2. Overview; 2.3. The bicriteria TSP(1, 2); 2.3.1. Simple examples of the non-approximability; 2.3.2. A local search heuristic for the bicriteria TSP(1, 2); 2.3.3. A nearest neighbor heuristic for the bicriteria TSP(1, 2); 2.3.4. On the bicriteria Max TSP(1, 2); 2.4. k-criteria TSP(1, 2); 2.4.1. Non-approximability related to the number of generated solutions; 2.4.2. A nearest neighbor heuristic for the k-criteria TSP(1, 2); 2.5. Conclusion; 2.6. Bibliography Chapter 3. Online Models for Set-covering: The Flaw of Greediness3.1. Introduction; 3.2. Description of the main results and related work; 3.3. The price of ignorance; 3.4. Competitiveness of TAKE-ALL and TAKE-AT-RANDOM; 3.4.1. TAKE-ALL algorithm; 3.4.2. TAKE-AT-RANDOM algorithm; 3.5. The nasty flaw of greediness; 3.6. The power of look-ahead; 3.7. The maximum budget saving problem; 3.8. Discussion; 3.9. Bibliography; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; 4.1. Introduction; 4.2. Time Petri nets and timed automata 4.2.1. Timed transition systems and equivalence relations4.2.2. Time Petri nets; 4.2.3. Timed automata; 4.2.4. Expressiveness and equivalence problems; 4.3. Comparison of semantics I, A and PA; 4.3.1. A first comparison between the different semantics of TPNs; 4.3.2. A second comparison for standard bounded TPN; 4.4. Strict ordering results; 4.5. Equivalence with respect to timed language acceptance; 4.5.1. Encoding atomic constraints; 4.5.2. Resetting clocks; 4.5.3. The complete construction; 4.5.4. Δ (A) and A accept the same timed language; 4.5.5. Consequences of the previous results 4.6. Bisimulation of TA by TPNs4.6.1. Regions of a timed automaton; 4.6.2. From bisimulation to uniform bisimulation; 4.6.3. A characterization of bisimilarity; 4.6.4. Proof of necessity; 4.6.5. First construction; 4.6.6. Second construction; 4.6.7. Complexity results; 4.7. Conclusion; 4.8. Bibliography; Chapter 5. A "Maximum Node Clustering" Problem; 5.1. Introduction; 5.2. Approximation algorithm for the general problem; 5.3. The tree case; 5.3.1. Dynamic programming; 5.3.2. A fully polynomial time approximation scheme; 5.4. Exponential algorithms for special cases; 5.5. Bibliography Chapter 6. The Patrolling Problem: Theoretical and Experimental Results |
| Record Nr. | UNINA-9910830062503321 |
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial optimization and theoretical computer science : interfaces and perspectives : 30th anniversary of the LAMSADE / / edited by Vangelis Th. Paschos
| Combinatorial optimization and theoretical computer science : interfaces and perspectives : 30th anniversary of the LAMSADE / / edited by Vangelis Th. Paschos |
| Pubbl/distr/stampa | London, : ISTE |
| Descrizione fisica | 1 online resource (518 p.) |
| Disciplina | 519.6/4 |
| Altri autori (Persone) | PaschosVangelis Th |
| Collana | ISTE |
| Soggetto topico |
Combinatorial optimization - Computer programs
Computer science - Mathematics |
| ISBN |
1-282-16499-6
9786612164996 0-470-61109-X 0-470-39367-X |
| Classificazione |
SK 890
ST 130 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; 1.1. Introduction; 1.2. Problem MinMax(1|prec|fmax, θ ); 1.2.1. Uncertainty on due dates; 1.2.2. Uncertainty on processing times and due dates; 1.3. Problem MinMax(1|| Σ wj Cj, Wj ); 1.4. Problem MinMax(1|| Σ Uj, θ ); 1.4.1. Uncertainty on due dates; 1.4.2. Uncertainty on processing times; 1.5. Bibliography; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); 2.1. Introduction
2.1.1. The traveling salesman problem2.1.2. Multi-criteria optimization; 2.1.3. Organization of the chapter; 2.2. Overview; 2.3. The bicriteria TSP(1, 2); 2.3.1. Simple examples of the non-approximability; 2.3.2. A local search heuristic for the bicriteria TSP(1, 2); 2.3.3. A nearest neighbor heuristic for the bicriteria TSP(1, 2); 2.3.4. On the bicriteria Max TSP(1, 2); 2.4. k-criteria TSP(1, 2); 2.4.1. Non-approximability related to the number of generated solutions; 2.4.2. A nearest neighbor heuristic for the k-criteria TSP(1, 2); 2.5. Conclusion; 2.6. Bibliography Chapter 3. Online Models for Set-covering: The Flaw of Greediness3.1. Introduction; 3.2. Description of the main results and related work; 3.3. The price of ignorance; 3.4. Competitiveness of TAKE-ALL and TAKE-AT-RANDOM; 3.4.1. TAKE-ALL algorithm; 3.4.2. TAKE-AT-RANDOM algorithm; 3.5. The nasty flaw of greediness; 3.6. The power of look-ahead; 3.7. The maximum budget saving problem; 3.8. Discussion; 3.9. Bibliography; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; 4.1. Introduction; 4.2. Time Petri nets and timed automata 4.2.1. Timed transition systems and equivalence relations4.2.2. Time Petri nets; 4.2.3. Timed automata; 4.2.4. Expressiveness and equivalence problems; 4.3. Comparison of semantics I, A and PA; 4.3.1. A first comparison between the different semantics of TPNs; 4.3.2. A second comparison for standard bounded TPN; 4.4. Strict ordering results; 4.5. Equivalence with respect to timed language acceptance; 4.5.1. Encoding atomic constraints; 4.5.2. Resetting clocks; 4.5.3. The complete construction; 4.5.4. Δ (A) and A accept the same timed language; 4.5.5. Consequences of the previous results 4.6. Bisimulation of TA by TPNs4.6.1. Regions of a timed automaton; 4.6.2. From bisimulation to uniform bisimulation; 4.6.3. A characterization of bisimilarity; 4.6.4. Proof of necessity; 4.6.5. First construction; 4.6.6. Second construction; 4.6.7. Complexity results; 4.7. Conclusion; 4.8. Bibliography; Chapter 5. A "Maximum Node Clustering" Problem; 5.1. Introduction; 5.2. Approximation algorithm for the general problem; 5.3. The tree case; 5.3.1. Dynamic programming; 5.3.2. A fully polynomial time approximation scheme; 5.4. Exponential algorithms for special cases; 5.5. Bibliography Chapter 6. The Patrolling Problem: Theoretical and Experimental Results |
| Record Nr. | UNINA-9910876678703321 |
| London, : ISTE | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph theory and applications with exercises and problems / / Jean-Claude Fournier
| Graph theory and applications with exercises and problems / / Jean-Claude Fournier |
| Autore | Fournier Jean-Claude |
| Pubbl/distr/stampa | London ; ; ISTE ; ; Hoboken, NJ, : Wiley, 2009 |
| Descrizione fisica | 1 online resource (284 p.) |
| Disciplina | 511/.5 |
| Collana | ISTE |
| Soggetto topico | Graph theory |
| ISBN |
1-118-62309-6
1-282-25390-5 9786613814555 0-470-61154-5 0-470-39420-X |
| Classificazione | SK 890 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Graph Theory and Applications with Exercises and Problems; Table of Contents; Introduction; Chapter 1. Basic Concepts; 1.1 The origin of the graph concept; 1.2 Definition of graphs; 1.2.1 Notation; 1.2.2 Representation; 1.2.3 Terminology; 1.2.4 Isomorphism and unlabeled graphs; 1.2.5 Planar graphs; 1.2.6 Complete graphs; 1.3 Subgraphs; 1.3.1 Customary notation; 1.4 Paths and cycles; 1.4.1 Paths; 1.4.2 Cycles; 1.4.3 Paths and cycles as graphs; 1.5 Degrees; 1.5.1 Regular graphs; 1.6 Connectedness; 1.7 Bipartite graphs; 1.7.1 Characterization; 1.8 Algorithmic aspects
1.8.1 Representations of graphs inside amachine1.8.2 Weighted graphs; 1.9 Exercises; Chapter 2. Trees; 2.1 Definitions and properties; 2.1.1 First properties of trees; 2.1.2 Forests; 2.1.3 Bridges; 2.1.4 Tree characterizations; 2.2 Spanning trees; 2.2.1 An interesting illustration of trees; 2.2.2 Spanning trees in a weighted graph; 2.3 Application: minimum spanning tree problem; 2.3.1 The problem; 2.3.2 Kruskal's algorithm; 2.3.3 Justification; 2.3.4 Implementation; 2.3.5 Complexity; 2.4 Connectivity; 2.4.1 Block decomposition; 2.4.2 k-connectivity; 2.4.3 k-connected graphs 2.4.4 Menger's theorem2.4.5 Edge connectivity; 2.4.6 k-edge-connected graphs; 2.4.7 Application to networks; 2.4.8 Hypercube; 2.5 Exercises; Chapter 3. Colorings; 3.1 Coloring problems; 3.2 Edge coloring; 3.2.1 Basic results; 3.3 Algorithmic aspects; 3.4 The timetabling problem; 3.4.1 Roomconstraints; 3.4.2 An example; 3.4.3 Conclusion; 3.5 Exercises; Chapter 4. Directed Graphs; 4.1 Definitions and basic concepts; 4.1.1 Notation; 4.1.2 Terminology; 4.1.3 Representation; 4.1.4 Underlying graph; 4.1.5 "Directed" concepts; 4.1.6 Indegrees and outdegrees; 4.1.7 Strongly connected components 4.1.8 Representations of digraphs inside a machine4.2 Acyclic digraphs; 4.2.1 Acyclic numbering; 4.2.2 Characterization; 4.2.3 Practical aspects; 4.3 Arborescences; 4.3.1 Drawings; 4.3.2 Terminology; 4.3.3 Characterization of arborescences; 4.3.4 Subarborescences; 4.3.5 Ordered arborescences; 4.3.6 Directed forests; 4.4 Exercises; Chapter 5. Search Algorithms; 5.1 Depth-first search of an arborescence; 5.1.1 Iterative form; 5.1.2 Visits to the vertices; 5.1.3 Justification; 5.1.4 Complexity; 5.2 Optimization of a sequence of decisions; 5.2.1 The eight queens problem 5.2.2 Application to game theory:finding a winning strategy5.2.3 Associated arborescence; 5.2.4 Example; 5.2.5 The minimax algorithm; 5.2.6 Implementation; 5.2.7 In concrete terms; 5.2.8 Pruning; 5.3 Depth-first search of a digraph; 5.3.1 Comments; 5.3.2 Justification; 5.3.3 Complexity; 5.3.4 Extended depth-first search; 5.3.5 Justification; 5.3.6 Complexity; 5.3.7 Application to acyclic numbering; 5.3.8 Acyclic numbering algorithms; 5.3.9 Practical implementation; 5.4 Exercises; Chapter 6. Optimal Paths; 6.1 Distances and shortest paths problems; 6.1.1 A few definitions 6.1.2 Types of problems |
| Record Nr. | UNINA-9910139510003321 |
|
Fournier Jean-Claude
|
||
| London ; ; ISTE ; ; Hoboken, NJ, : Wiley, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Kompendium der diskreten Mathematik / / Bernd Baumgarten
| Kompendium der diskreten Mathematik / / Bernd Baumgarten |
| Autore | Baumgarten Bernd |
| Pubbl/distr/stampa | Munich, Germany : , : De Gruyter, , 2014 |
| Descrizione fisica | 1 online resource (388 p.) |
| Disciplina | 004.01/51 |
| Collana | De Gruyter Studium |
| Soggetto topico | Computer science - Mathematics |
| Soggetto genere / forma | Electronic books. |
| ISBN |
3-11-039649-1
3-486-78132-4 |
| Classificazione | SK 890 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ger |
| Nota di contenuto | Frontmatter -- Inhaltsverzeichnis -- 1. Einleitung -- 2. Mengen -- 3. Relationen und Funktionen -- 4. Logik -- 5. Zahlen und Anzahlen -- 6. Graphen -- 7. Algebra -- 8. Diskrete Wahrscheinlichkeitstheorie -- Literatur -- Stichwortverzeichnis |
| Record Nr. | UNINA-9910460166803321 |
|
Baumgarten Bernd
|
||
| Munich, Germany : , : De Gruyter, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Kompendium der diskreten Mathematik / / Bernd Baumgarten
| Kompendium der diskreten Mathematik / / Bernd Baumgarten |
| Autore | Baumgarten Bernd |
| Pubbl/distr/stampa | Munich, Germany : , : De Gruyter, , 2014 |
| Descrizione fisica | 1 online resource (388 p.) |
| Disciplina | 004.01/51 |
| Collana | De Gruyter Studium |
| Soggetto topico | Computer science - Mathematics |
| Soggetto non controllato | Discrete mathematics, reference work, discrete probability theory |
| ISBN |
3-11-039649-1
3-486-78132-4 |
| Classificazione | SK 890 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ger |
| Nota di contenuto | Frontmatter -- Inhaltsverzeichnis -- 1. Einleitung -- 2. Mengen -- 3. Relationen und Funktionen -- 4. Logik -- 5. Zahlen und Anzahlen -- 6. Graphen -- 7. Algebra -- 8. Diskrete Wahrscheinlichkeitstheorie -- Literatur -- Stichwortverzeichnis |
| Record Nr. | UNINA-9910787399003321 |
|
Baumgarten Bernd
|
||
| Munich, Germany : , : De Gruyter, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
