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.
Algorithmics of matching under preferences / / David F. Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn
| Algorithmics of matching under preferences / / David F. Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn |
| Autore | Manlove David F |
| Pubbl/distr/stampa | [Hackensack] N.J., : World Scientific, c2013 |
| Descrizione fisica | 1 online resource (xxxi, 491 pages) |
| Disciplina | 005.1 |
| Collana | Series on theoretical computer science |
| Soggetto topico |
Matching theory
Marriage theorem Computer science - Mathematics |
| ISBN |
1-299-46251-0
981-4425-25-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Foreword; Acknowledgments; Contents; List of Figures; List of Tables; List of Algorithms; 1. Preliminary definitions, results and motivation; 1.1 Introduction; 1.1.1 Remit of this book; 1.1.1.1 Matching under preferences; 1.1.1.2 Free-for-all markets; 1.1.1.3 Centralised matching schemes; 1.1.2 The matching problems under consideration; 1.1.2.1 Classification of matching problems; 1.1.2.2 Bipartite matching problems with two-sided preferences; 1.1.2.3 Bipartite matching problems with one-sided preferences; 1.1.2.4 Non-bipartite matching problems with preferences
1.1.2.5 Further problem variants1.1.3 Existing literature on matching problems; 1.1.3.1 Algorithms and complexity literature; 1.1.3.2 Game theory and economics literature; 1.1.3.3 Algorithmic mechanism design literature; 1.1.4 Contribution of this book; 1.1.4.1 General overview; 1.1.4.2 Chapter outline; 1.1.4.3 What the book does not contribute; 1.1.5 Outline of this chapter; 1.2 Matchings in graphs; 1.3 The Hospitals / Residents problem (hr); 1.3.1 Introduction; 1.3.2 Key definitions; 1.3.3 Key results (up to 1989); 1.3.4 Stable Marriage problem (sm); 1.3.4.1 Key definitions 1.3.4.2 Key results (up to 1989)1.3.4.3 Rotations; 1.3.5 Hospitals / Residents problem with indifference; 1.3.6 Other variants of hr; 1.3.6.1 Couples; 1.3.6.2 Many-many stable matchings; 1.3.6.3 Master lists; 1.3.7 Motivation; 1.4 The Stable Roommates problem (sr); 1.4.1 Introduction; 1.4.2 Key definitions; 1.4.3 Key results (up to 1989); 1.4.4 Rotations; 1.4.5 Stable Roommates problem with indifference; 1.4.6 Motivation; 1.5 The House Allocation problem (ha) and its variants; 1.5.1 Introduction; 1.5.2 Formal definition of ha and hm; 1.5.3 Pareto optimal matchings 1.5.4 Maximum utility matchings1.5.5 Popular matchings; 1.5.6 Profile-based optimal matchings; 1.5.7 Extensions of ha; 1.5.8 Motivation; Stable Matching Problems; 2. The Stable Marriage problem: An update; 2.1 Introduction; 2.2 The 12 open problems of Gusfield and Irving; 2.2.1 Introduction; 2.2.2 1. Maximum number of stable matchings; 2.2.3 2. The "divorce digraph"; 2.2.4 3. Parallel algorithms for stable marriage; 2.2.5 4. Batch stability testing; 2.2.6 5. Structure of stable marriage with ties; 2.2.7 6. Sex-equal matching; 2.2.8 7. Lying and egalitarian matchings 2.2.9 10. Succinct certificates2.2.10 11. Algorithmic improvements; 2.3 The Subramanian and Feder papers; 2.3.1 Subramanian: sri and network stability; 2.3.2 Feder: sri and 2-sat; 2.3.3 Other fixed-point approaches; 2.4 Linear programming approaches; 2.5 Constraint programming approaches; 2.5.1 Introduction; 2.5.2 Preliminaries; 2.5.3 Overview of the csp model; 2.5.4 Arc consistency in the csp model; 2.6 Paths to stability; 2.6.1 Introduction; 2.6.2 The Roth-Vande Vate Mechanism; 2.6.3 The Random Order Mechanism; 2.6.4 Other decentralised algorithms; 2.7 Median stable matchings 2.8 Size versus stability |
| Record Nr. | UNINA-9910779692703321 |
Manlove David F
|
||
| [Hackensack] N.J., : World Scientific, c2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmics of matching under preferences / / David F. Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn
| Algorithmics of matching under preferences / / David F. Manlove, University of Glasgow, UK ; with a foreword by Kurt Mehlhorn |
| Autore | Manlove David F |
| Pubbl/distr/stampa | [Hackensack] N.J., : World Scientific, c2013 |
| Descrizione fisica | 1 online resource (xxxi, 491 pages) |
| Disciplina | 005.1 |
| Collana | Series on theoretical computer science |
| Soggetto topico |
Matching theory
Marriage theorem Computer science - Mathematics |
| ISBN |
1-299-46251-0
981-4425-25-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Foreword; Acknowledgments; Contents; List of Figures; List of Tables; List of Algorithms; 1. Preliminary definitions, results and motivation; 1.1 Introduction; 1.1.1 Remit of this book; 1.1.1.1 Matching under preferences; 1.1.1.2 Free-for-all markets; 1.1.1.3 Centralised matching schemes; 1.1.2 The matching problems under consideration; 1.1.2.1 Classification of matching problems; 1.1.2.2 Bipartite matching problems with two-sided preferences; 1.1.2.3 Bipartite matching problems with one-sided preferences; 1.1.2.4 Non-bipartite matching problems with preferences
1.1.2.5 Further problem variants1.1.3 Existing literature on matching problems; 1.1.3.1 Algorithms and complexity literature; 1.1.3.2 Game theory and economics literature; 1.1.3.3 Algorithmic mechanism design literature; 1.1.4 Contribution of this book; 1.1.4.1 General overview; 1.1.4.2 Chapter outline; 1.1.4.3 What the book does not contribute; 1.1.5 Outline of this chapter; 1.2 Matchings in graphs; 1.3 The Hospitals / Residents problem (hr); 1.3.1 Introduction; 1.3.2 Key definitions; 1.3.3 Key results (up to 1989); 1.3.4 Stable Marriage problem (sm); 1.3.4.1 Key definitions 1.3.4.2 Key results (up to 1989)1.3.4.3 Rotations; 1.3.5 Hospitals / Residents problem with indifference; 1.3.6 Other variants of hr; 1.3.6.1 Couples; 1.3.6.2 Many-many stable matchings; 1.3.6.3 Master lists; 1.3.7 Motivation; 1.4 The Stable Roommates problem (sr); 1.4.1 Introduction; 1.4.2 Key definitions; 1.4.3 Key results (up to 1989); 1.4.4 Rotations; 1.4.5 Stable Roommates problem with indifference; 1.4.6 Motivation; 1.5 The House Allocation problem (ha) and its variants; 1.5.1 Introduction; 1.5.2 Formal definition of ha and hm; 1.5.3 Pareto optimal matchings 1.5.4 Maximum utility matchings1.5.5 Popular matchings; 1.5.6 Profile-based optimal matchings; 1.5.7 Extensions of ha; 1.5.8 Motivation; Stable Matching Problems; 2. The Stable Marriage problem: An update; 2.1 Introduction; 2.2 The 12 open problems of Gusfield and Irving; 2.2.1 Introduction; 2.2.2 1. Maximum number of stable matchings; 2.2.3 2. The "divorce digraph"; 2.2.4 3. Parallel algorithms for stable marriage; 2.2.5 4. Batch stability testing; 2.2.6 5. Structure of stable marriage with ties; 2.2.7 6. Sex-equal matching; 2.2.8 7. Lying and egalitarian matchings 2.2.9 10. Succinct certificates2.2.10 11. Algorithmic improvements; 2.3 The Subramanian and Feder papers; 2.3.1 Subramanian: sri and network stability; 2.3.2 Feder: sri and 2-sat; 2.3.3 Other fixed-point approaches; 2.4 Linear programming approaches; 2.5 Constraint programming approaches; 2.5.1 Introduction; 2.5.2 Preliminaries; 2.5.3 Overview of the csp model; 2.5.4 Arc consistency in the csp model; 2.6 Paths to stability; 2.6.1 Introduction; 2.6.2 The Roth-Vande Vate Mechanism; 2.6.3 The Random Order Mechanism; 2.6.4 Other decentralised algorithms; 2.7 Median stable matchings 2.8 Size versus stability |
| Record Nr. | UNINA-9910813941703321 |
|
Manlove David F
|
||
| [Hackensack] N.J., : World Scientific, c2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Bridging the gap between graph edit distance and kernel machines [[electronic resource] /] / Michel Neuhaus, Horst Bunke
| Bridging the gap between graph edit distance and kernel machines [[electronic resource] /] / Michel Neuhaus, Horst Bunke |
| Autore | Neuhaus Michel |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (244 p.) |
| Disciplina |
003.52
003/.52 006.4 |
| Altri autori (Persone) | BunkeHorst |
| Collana | Series in machine perception and artificial intelligence |
| Soggetto topico |
Pattern recognition systems
Matching theory Machine learning Kernel functions Graph theory |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-91905-5
9786611919054 981-277-020-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Introduction; 2. Graph Matching; 2.1 Graph and Subgraph; 2.2 Exact Graph Matching; 2.3 Error-Tolerant Graph Matching; 3. Graph Edit Distance; 3.1 Definition; 3.2 Edit Cost Functions; 3.2.1 Conditions on Edit Costs; 3.2.2 Examples of Edit Costs; 3.3 Exact Algorithm; 3.4 Efficient Approximate Algorithm; 3.4.1 Algorithm; 3.4.2 Experimental Results; 3.5 Quadratic Programming Algorithm; 3.5.1 Algorithm; 3.5.1.1 Quadratic Programming; 3.5.1.2 Fuzzy Edit Path; 3.5.1.3 Quadratic Programming Edit Path Optimization; 3.5.2 Experimental Results; 3.6 Nearest-Neighbor Classification
3.7 An Application: Data-Level Fusion of Graphs 3.7.1 Fusion of Graphs; 3.7.2 Experimental Results; 4. Kernel Machines; 4.1 Learning Theory; 4.1.1 Empirical Risk Minimization; 4.1.2 Structural Risk Minimization; 4.2 Kernel Functions; 4.2.1 Valid Kernels; 4.2.2 Feature Space Embedding and Kernel Trick; 4.3 Kernel Machines; 4.3.1 Support Vector Machine; 4.3.2 Kernel Principal Component Analysis; 4.3.3 Kernel Fisher Discriminant Analysis; 4.3.4 Using Non-Positive De nite Kernel Functions; 4.4 Nearest-Neighbor Classification Revisited; 5. Graph Kernels; 5.1 Kernel Machines for Graph Matching 5.2 Related Work 5.3 Trivial Similarity Kernel from Edit Distance; 5.4 Kernel from Maximum-Similarity Edit Path; 5.5 Diffusion Kernel from Edit Distance; 5.6 Zero Graph Kernel from Edit Distance; 5.7 Convolution Edit Kernel; 5.8 Local Matching Kernel; 5.9 Random Walk Edit Kernel; 6. Experimental Results; 6.1 Line Drawing and Image Graph Data Sets; 6.1.1 Letter Line Drawing Graphs; 6.1.2 Image Graphs; 6.1.3 Diatom Graphs; 6.2 Fingerprint Graph Data Set; 6.2.1 Biometric Person Authentication; 6.2.2 Fingerprint Classification; 6.2.3 Fingerprint Graphs; 6.3 Molecule Graph Data Set 6.4 Experimental Setup 6.5 Evaluation of Graph Edit Distance; 6.5.1 Letter Graphs; 6.5.2 Image Graphs; 6.5.3 Diatom Graphs; 6.5.4 Fingerprint Graphs; 6.5.5 Molecule Graphs; 6.6 Evaluation of Graph Kernels; 6.6.1 Trivial Similarity Kernel from Edit Distance; 6.6.2 Kernel from Maximum-Similarity Edit Path; 6.6.3 Diffusion Kernel from Edit Distance; 6.6.4 Zero Graph Kernel from Edit Distance; 6.6.5 Convolution Edit Kernel; 6.6.6 Local Matching Kernel; 6.6.7 Random Walk Edit Kernel; 6.7 Summary and Discussion; 7. Conclusions; Appendix A Graph Data Sets; A.1 Letter Data Set; A.2 Image Data Set A.3 Diatom Data Set A.4 Fingerprint Data Set; A.5 Molecule Data Set; Bibliography; Index |
| Record Nr. | UNINA-9910451557203321 |
|
Neuhaus Michel
|
||
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Bridging the gap between graph edit distance and kernel machines [[electronic resource] /] / Michel Neuhaus, Horst Bunke
| Bridging the gap between graph edit distance and kernel machines [[electronic resource] /] / Michel Neuhaus, Horst Bunke |
| Autore | Neuhaus Michel |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (244 p.) |
| Disciplina |
003.52
003/.52 006.4 |
| Altri autori (Persone) | BunkeHorst |
| Collana | Series in machine perception and artificial intelligence |
| Soggetto topico |
Pattern recognition systems
Matching theory Machine learning Kernel functions Graph theory |
| ISBN |
1-281-91905-5
9786611919054 981-277-020-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Preface; Contents; 1. Introduction; 2. Graph Matching; 2.1 Graph and Subgraph; 2.2 Exact Graph Matching; 2.3 Error-Tolerant Graph Matching; 3. Graph Edit Distance; 3.1 Definition; 3.2 Edit Cost Functions; 3.2.1 Conditions on Edit Costs; 3.2.2 Examples of Edit Costs; 3.3 Exact Algorithm; 3.4 Efficient Approximate Algorithm; 3.4.1 Algorithm; 3.4.2 Experimental Results; 3.5 Quadratic Programming Algorithm; 3.5.1 Algorithm; 3.5.1.1 Quadratic Programming; 3.5.1.2 Fuzzy Edit Path; 3.5.1.3 Quadratic Programming Edit Path Optimization; 3.5.2 Experimental Results; 3.6 Nearest-Neighbor Classification
3.7 An Application: Data-Level Fusion of Graphs 3.7.1 Fusion of Graphs; 3.7.2 Experimental Results; 4. Kernel Machines; 4.1 Learning Theory; 4.1.1 Empirical Risk Minimization; 4.1.2 Structural Risk Minimization; 4.2 Kernel Functions; 4.2.1 Valid Kernels; 4.2.2 Feature Space Embedding and Kernel Trick; 4.3 Kernel Machines; 4.3.1 Support Vector Machine; 4.3.2 Kernel Principal Component Analysis; 4.3.3 Kernel Fisher Discriminant Analysis; 4.3.4 Using Non-Positive De nite Kernel Functions; 4.4 Nearest-Neighbor Classification Revisited; 5. Graph Kernels; 5.1 Kernel Machines for Graph Matching 5.2 Related Work 5.3 Trivial Similarity Kernel from Edit Distance; 5.4 Kernel from Maximum-Similarity Edit Path; 5.5 Diffusion Kernel from Edit Distance; 5.6 Zero Graph Kernel from Edit Distance; 5.7 Convolution Edit Kernel; 5.8 Local Matching Kernel; 5.9 Random Walk Edit Kernel; 6. Experimental Results; 6.1 Line Drawing and Image Graph Data Sets; 6.1.1 Letter Line Drawing Graphs; 6.1.2 Image Graphs; 6.1.3 Diatom Graphs; 6.2 Fingerprint Graph Data Set; 6.2.1 Biometric Person Authentication; 6.2.2 Fingerprint Classification; 6.2.3 Fingerprint Graphs; 6.3 Molecule Graph Data Set 6.4 Experimental Setup 6.5 Evaluation of Graph Edit Distance; 6.5.1 Letter Graphs; 6.5.2 Image Graphs; 6.5.3 Diatom Graphs; 6.5.4 Fingerprint Graphs; 6.5.5 Molecule Graphs; 6.6 Evaluation of Graph Kernels; 6.6.1 Trivial Similarity Kernel from Edit Distance; 6.6.2 Kernel from Maximum-Similarity Edit Path; 6.6.3 Diffusion Kernel from Edit Distance; 6.6.4 Zero Graph Kernel from Edit Distance; 6.6.5 Convolution Edit Kernel; 6.6.6 Local Matching Kernel; 6.6.7 Random Walk Edit Kernel; 6.7 Summary and Discussion; 7. Conclusions; Appendix A Graph Data Sets; A.1 Letter Data Set; A.2 Image Data Set A.3 Diatom Data Set A.4 Fingerprint Data Set; A.5 Molecule Data Set; Bibliography; Index |
| Record Nr. | UNINA-9910777303003321 |
|
Neuhaus Michel
|
||
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorial pattern matching : 17th annual symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006 : proceedings / / Moshe Lewenstein, Gabriel Valiente (eds.)
| Combinatorial pattern matching : 17th annual symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006 : proceedings / / Moshe Lewenstein, Gabriel Valiente (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XII, 420 p.) |
| Disciplina | 006.4 |
| Altri autori (Persone) |
LewensteinMoshe
ValienteGabriel |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computer algorithms
Combinatorial analysis Matching theory |
| ISBN | 3-540-35461-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Asynchronous Pattern Matching -- Asynchronous Pattern Matching -- SNP and Haplotype Analysis – Algorithms and Applications -- Identifying Co-referential Names Across Large Corpora -- Session 1. Data Structures -- Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents -- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE -- Session 2. Indexing Data Structures -- A Linear Size Index for Approximate Pattern Matching -- On-Line Linear-Time Construction of Word Suffix Trees -- Obtaining Provably Good Performance from Suffix Trees in Secondary Storage -- Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures -- Session 3. Probabilistic and Algebraic Techniques -- New Bounds for Motif Finding in Strong Instances -- Fingerprint Clustering with Bounded Number of Missing Values -- Tiling an Interval of the Discrete Line -- Common Substrings in Random Strings -- Session 4. Applications in Molecular Biology I -- On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem -- Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms -- Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees -- An Improved Algorithm for the Macro-evolutionary Phylogeny Problem -- Session 5. String Matching I -- Property Matching and Weighted Matching -- Faster Two Dimensional Scaled Matching -- Session 6. Applications in Molecular Biology II -- Approximation of RNA Multiple Structural Alignment -- Finding Common RNA Pseudoknot Structures in Polynomial Time -- A Compact Mathematical Programming Formulation for DNA Motif Finding -- Local Alignment of RNA Sequences with Arbitrary Scoring Schemes -- Session 7. Applications in Molecular Biology III -- An Algorithm for Sorting by Reciprocal Translocations -- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs -- Session 8. Data Compression -- A Simpler Analysis of Burrows-Wheeler Based Compression -- Statistical Encoding of Succinct Data Structures -- Dynamic Entropy-Compressed Sequences and Full-Text Indexes -- Reducing the Space Requirement of LZ-Index -- Session 9. String Matching II -- Faster Algorithms for Computing Longest Common Increasing Subsequences -- New Algorithms for Text Fingerprinting -- Sublinear Algorithms for Parameterized Matching -- Approximate Matching in Weighted Sequences -- Session 10. Dynamic Programming -- Algorithms for Finding a Most Similar Subforest -- Efficient Algorithms for Regular Expression Constrained Sequence Alignment -- Large Scale Matching for Position Weight Matrices. |
| Altri titoli varianti | CPM 2006 |
| Record Nr. | UNINA-9910484198003321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft
| A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft |
| Autore | Keevash Peter <1978-> |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 2014 |
| Descrizione fisica | 1 online resource (95 p.) |
| Disciplina | 511/.5 |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Hypergraphs
Matching theory |
| Soggetto genere / forma | Electronic books. |
| ISBN | 1-4704-1966-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""4.2. Transferral digraphs""""4.3. Completion of the transferral digraph""; ""Chapter 5. Transferrals via the minimum degree sequence""; ""Chapter 6. Hypergraph Regularity Theory""; ""6.1. Hypergraph regularity""; ""6.2. The Regular Approximation Lemma""; ""6.3. The hypergraph blowup lemma""; ""6.4. Reduced -systems""; ""6.5. Proof of Lemma 5.5""; ""Chapter 7. Matchings in -systems""; ""7.1. Fractional perfect matchings""; ""7.2. Almost perfect matchings""; ""7.3. Perfect matchings""; ""Chapter 8. Packing Tetrahedra""; ""8.1. Packing to within a constant""
""8.2. Properties of index vectors""""8.3. Divisibility barriers with two parts""; ""8.4. Divisibility barriers with more parts""; ""8.5. The main case of Theorem 1.1""; ""8.6. The case when 8 divides ""; ""8.7. Strong stability for perfect matchings""; ""Chapter 9. The general theory""; ""Acknowledgements""; ""Bibliography""; ""Back Cover"" |
| Record Nr. | UNINA-9910480011503321 |
|
Keevash Peter <1978->
|
||
| Providence, Rhode Island : , : American Mathematical Society, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft
| A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft |
| Autore | Keevash Peter <1978-> |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 2014 |
| Descrizione fisica | 1 online resource (95 p.) |
| Disciplina | 511/.5 |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Hypergraphs
Matching theory |
| ISBN | 1-4704-1966-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""4.2. Transferral digraphs""""4.3. Completion of the transferral digraph""; ""Chapter 5. Transferrals via the minimum degree sequence""; ""Chapter 6. Hypergraph Regularity Theory""; ""6.1. Hypergraph regularity""; ""6.2. The Regular Approximation Lemma""; ""6.3. The hypergraph blowup lemma""; ""6.4. Reduced -systems""; ""6.5. Proof of Lemma 5.5""; ""Chapter 7. Matchings in -systems""; ""7.1. Fractional perfect matchings""; ""7.2. Almost perfect matchings""; ""7.3. Perfect matchings""; ""Chapter 8. Packing Tetrahedra""; ""8.1. Packing to within a constant""
""8.2. Properties of index vectors""""8.3. Divisibility barriers with two parts""; ""8.4. Divisibility barriers with more parts""; ""8.5. The main case of Theorem 1.1""; ""8.6. The case when 8 divides ""; ""8.7. Strong stability for perfect matchings""; ""Chapter 9. The general theory""; ""Acknowledgements""; ""Bibliography""; ""Back Cover"" |
| Record Nr. | UNINA-9910797018603321 |
|
Keevash Peter <1978->
|
||
| Providence, Rhode Island : , : American Mathematical Society, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft
| A geometric theory for hypergraph matching / / Peter Keevash, Richard Mycroft |
| Autore | Keevash Peter <1978-> |
| Pubbl/distr/stampa | Providence, Rhode Island : , : American Mathematical Society, , 2014 |
| Descrizione fisica | 1 online resource (95 p.) |
| Disciplina | 511/.5 |
| Collana | Memoirs of the American Mathematical Society |
| Soggetto topico |
Hypergraphs
Matching theory |
| ISBN | 1-4704-1966-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
""4.2. Transferral digraphs""""4.3. Completion of the transferral digraph""; ""Chapter 5. Transferrals via the minimum degree sequence""; ""Chapter 6. Hypergraph Regularity Theory""; ""6.1. Hypergraph regularity""; ""6.2. The Regular Approximation Lemma""; ""6.3. The hypergraph blowup lemma""; ""6.4. Reduced -systems""; ""6.5. Proof of Lemma 5.5""; ""Chapter 7. Matchings in -systems""; ""7.1. Fractional perfect matchings""; ""7.2. Almost perfect matchings""; ""7.3. Perfect matchings""; ""Chapter 8. Packing Tetrahedra""; ""8.1. Packing to within a constant""
""8.2. Properties of index vectors""""8.3. Divisibility barriers with two parts""; ""8.4. Divisibility barriers with more parts""; ""8.5. The main case of Theorem 1.1""; ""8.6. The case when 8 divides ""; ""8.7. Strong stability for perfect matchings""; ""Chapter 9. The general theory""; ""Acknowledgements""; ""Bibliography""; ""Back Cover"" |
| Record Nr. | UNINA-9910816958903321 |
|
Keevash Peter <1978->
|
||
| Providence, Rhode Island : , : American Mathematical Society, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Jewels of stringology [[electronic resource] /] / Maxime Crochemore, Wojciech Rytter
| Jewels of stringology [[electronic resource] /] / Maxime Crochemore, Wojciech Rytter |
| Autore | Crochemore Maxime <1947-> |
| Pubbl/distr/stampa | Singapore ; ; River Edge, NJ, : World Scientific, 2002 |
| Descrizione fisica | x, 310 p. : ill |
| Disciplina | 005.1 |
| Altri autori (Persone) | RytterWojciech |
| Soggetto topico |
Computer algorithms
Matching theory |
| Soggetto genere / forma | Electronic books. |
| ISBN | 981-277-822-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Stringology. 1.1. Text file facilities. 1.2. Dictionaries. 1.3. Data compression. 1.4. Applications of text algorithms in genetics. 1.5. Efficiency of algorithms. 1.6. Some notation and formal definitions. 1.7. Some simple combinatorics of strings. 1.8. Some other interesting strings. 1.9. Cyclic shifts and primitive words -- 2. Basic string searching algorithms. 2.1. Knuth-Morris-Pratt algorithm. 2.2. Boyer-Moore algorithm and its variations -- 3. Preprocessing for basic searchings. 3.1. Preprocessing patterns for MP and KMP algorithms. 3.2. Table of prefixes. 3.3. Preprocessing for Boyer-Moore algorithm. 3.4. * Analysis of Boyer-Moore algorithm -- 4. On-line construction of suffix trees. 4.1. Tries and their compact versions. 4.2. Prelude to Ukkonen algorithm. 4.3. Ukkonen algorithm -- 5. More on suffix trees. 5.1. Several applications of suffix trees. 5.2. McCreight algorithm -- 6. Subword graphs. 6.1. Directed acyclic graph. 6.2. On-line construction of subword graphs. 6.3. The reverse perspective. 6.4. Compact subword graphs -- 7. Text algorithms related to sorting. 7.1. The naming technique: KMR algorithm. 7.2. Two-dimensional KMR algorithm. 7.3. Suffix arrays. 7.4. Constructing suffix trees by sorting. 7.5. The Lowest-Common-Ancestor dictionary. 7.6. Suffix-Merge-Sort -- 8. Symmetries and repetitions in texts. 8.1. Searching for symmetric words. 8.2. Compositions of symmetric words. 8.3. Searching for square factors -- 9. Constant-space searchings. 9.1. Constant-space matching for easy patterns. 9.2. MaxSuffix-matching. 9.3. Computation of maximal suffixes. 9.4. Matching patterns with short maximal suffixes. 9.5. Two-way matching and magic decomposition. 9.6. Sequential sampling for unordered alphabets. 9.7. Galil-Seiferas algorithm. 9.8. Cyclic equality of words -- 10. Text compression techniques. 10.1. Substitutions. 10.2. Static Huffman coding. 10.3. Dynamic Huffman coding. 10.4. Factor encoding -- 11. Automata-theoretic approach. 11.1. Aho-Corasick automaton. 11.2. Determinizing automata. 11.3. Two-way pushdown automata -- 12. Approximate pattern matching. 12.1. Edit distance. 12.2. Longest common subsequence problem. 12.3. String matching with errors. 12.4. String matching with don't care symbols -- 13. Matching by dueling and sampling. 13.1. String matching by duels. 13.2. String matching by sampling -- 14. Two-dimensional pattern matching. 14.1. Multi-pattern approach. 14.2. Don't cares and non-rectangular patterns. 14.3. 2D-Pattern matching with mismatches. 14.4. Multi-pattern matching. 14.5. Matching by sampling. 14.6. An algorithm fast on the average -- 15. Two-dimensional periodicities. 15.1. Amir-Benson-Farach algorithm. 15.2. Geometry of two-dimensional periodicities. 15.3. * Patterns with large monochromatic centers. 15.4. * A version of the Galil-Park algorithm -- 16. Parallel text algorithms. 16.1. The abstract model of parallel computing. 16.2. Parallel string-matching algorithms. 16.3. * Splitting technique. 16.4. Parallel KMR algorithm and application. 16.5. Parallel Huffman coding. 16.6. Edit distance - efficient parallel computation -- 17. Miscellaneous. 17.1. Karp-Rabin string matching by hashing. 17.2. Shortest common superstrings. 17.3. Unique-decipherability problem. 17.4. Parameterized pattern matching. 17.5. Breaking paragraphs into lines. |
| Record Nr. | UNINA-9910451258303321 |
|
Crochemore Maxime <1947->
|
||
| Singapore ; ; River Edge, NJ, : World Scientific, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Jewels of stringology [[electronic resource] /] / Maxime Crochemore, Wojciech Rytter
| Jewels of stringology [[electronic resource] /] / Maxime Crochemore, Wojciech Rytter |
| Autore | Crochemore Maxime <1947-> |
| Pubbl/distr/stampa | Singapore ; ; River Edge, NJ, : World Scientific, 2002 |
| Descrizione fisica | x, 310 p. : ill |
| Disciplina | 005.1 |
| Altri autori (Persone) | RytterWojciech |
| Soggetto topico |
Computer algorithms
Matching theory |
| ISBN | 981-277-822-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Stringology. 1.1. Text file facilities. 1.2. Dictionaries. 1.3. Data compression. 1.4. Applications of text algorithms in genetics. 1.5. Efficiency of algorithms. 1.6. Some notation and formal definitions. 1.7. Some simple combinatorics of strings. 1.8. Some other interesting strings. 1.9. Cyclic shifts and primitive words -- 2. Basic string searching algorithms. 2.1. Knuth-Morris-Pratt algorithm. 2.2. Boyer-Moore algorithm and its variations -- 3. Preprocessing for basic searchings. 3.1. Preprocessing patterns for MP and KMP algorithms. 3.2. Table of prefixes. 3.3. Preprocessing for Boyer-Moore algorithm. 3.4. * Analysis of Boyer-Moore algorithm -- 4. On-line construction of suffix trees. 4.1. Tries and their compact versions. 4.2. Prelude to Ukkonen algorithm. 4.3. Ukkonen algorithm -- 5. More on suffix trees. 5.1. Several applications of suffix trees. 5.2. McCreight algorithm -- 6. Subword graphs. 6.1. Directed acyclic graph. 6.2. On-line construction of subword graphs. 6.3. The reverse perspective. 6.4. Compact subword graphs -- 7. Text algorithms related to sorting. 7.1. The naming technique: KMR algorithm. 7.2. Two-dimensional KMR algorithm. 7.3. Suffix arrays. 7.4. Constructing suffix trees by sorting. 7.5. The Lowest-Common-Ancestor dictionary. 7.6. Suffix-Merge-Sort -- 8. Symmetries and repetitions in texts. 8.1. Searching for symmetric words. 8.2. Compositions of symmetric words. 8.3. Searching for square factors -- 9. Constant-space searchings. 9.1. Constant-space matching for easy patterns. 9.2. MaxSuffix-matching. 9.3. Computation of maximal suffixes. 9.4. Matching patterns with short maximal suffixes. 9.5. Two-way matching and magic decomposition. 9.6. Sequential sampling for unordered alphabets. 9.7. Galil-Seiferas algorithm. 9.8. Cyclic equality of words -- 10. Text compression techniques. 10.1. Substitutions. 10.2. Static Huffman coding. 10.3. Dynamic Huffman coding. 10.4. Factor encoding -- 11. Automata-theoretic approach. 11.1. Aho-Corasick automaton. 11.2. Determinizing automata. 11.3. Two-way pushdown automata -- 12. Approximate pattern matching. 12.1. Edit distance. 12.2. Longest common subsequence problem. 12.3. String matching with errors. 12.4. String matching with don't care symbols -- 13. Matching by dueling and sampling. 13.1. String matching by duels. 13.2. String matching by sampling -- 14. Two-dimensional pattern matching. 14.1. Multi-pattern approach. 14.2. Don't cares and non-rectangular patterns. 14.3. 2D-Pattern matching with mismatches. 14.4. Multi-pattern matching. 14.5. Matching by sampling. 14.6. An algorithm fast on the average -- 15. Two-dimensional periodicities. 15.1. Amir-Benson-Farach algorithm. 15.2. Geometry of two-dimensional periodicities. 15.3. * Patterns with large monochromatic centers. 15.4. * A version of the Galil-Park algorithm -- 16. Parallel text algorithms. 16.1. The abstract model of parallel computing. 16.2. Parallel string-matching algorithms. 16.3. * Splitting technique. 16.4. Parallel KMR algorithm and application. 16.5. Parallel Huffman coding. 16.6. Edit distance - efficient parallel computation -- 17. Miscellaneous. 17.1. Karp-Rabin string matching by hashing. 17.2. Shortest common superstrings. 17.3. Unique-decipherability problem. 17.4. Parameterized pattern matching. 17.5. Breaking paragraphs into lines. |
| Record Nr. | UNINA-9910784735803321 |
|
Crochemore Maxime <1947->
|
||
| Singapore ; ; River Edge, NJ, : World Scientific, 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||