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.
Classes of Directed Graphs / / edited by Jørgen Bang-Jensen, Gregory Gutin
| Classes of Directed Graphs / / edited by Jørgen Bang-Jensen, Gregory Gutin |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (654 pages) |
| Disciplina | 512.46 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Graph theory
Computer science - Mathematics Discrete mathematics Algorithms Graph Theory Discrete Mathematics in Computer Science |
| ISBN | 3-319-71840-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Basic Terminology, Notation and Results (J. Bang-Jensen, G. Gutin) -- 2. Tournaments and Semicomplete Digraphs (J. Bang-Jensen, F. Havet) -- 3. Acyclic Digraphs (G. Gutin) -- 4. Euler Digraphs (M. Wahlström) -- 5. Planar digraphs (M. Pilipczuk, M. Pilipczuk) -- 6. Locally Semicomplete Digraphs and Generalizations (J. Bang-Jensen) -- 7. Semicomplete Multipartite Digraphs (A. Yeo) -- 8. Quasi-Transitive Digraphs and Their Extensions (H. Galeana-Sánchez, C. Hernández-Cruz) -- 9. Digraphs of Bounded Width (S. Kreutzer, O. Kwon) -- 10. Digraphs Products (R. Hammack) -- 11. Miscellaneous Digraph Classes (Y. Guo, M. Surmacs) -- 12. Lexicographic Orientation Algorithms (J. Huang) -- Indices. |
| Record Nr. | UNINA-9910300119003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider
| Parameterized and Exact Computation [[electronic resource] ] : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 375 p. 28 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-319-03898-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. |
| Record Nr. | UNISA-996465379803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider
| Parameterized and Exact Computation : 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers / / edited by Gregory Gutin, Stefan Szeider |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 375 p. 28 illus.) |
| Disciplina | 519.544 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Numerical analysis Computer science—Mathematics Discrete mathematics Artificial intelligence—Data processing Numerical Analysis Discrete Mathematics in Computer Science Data Science Mathematical Applications in Computer Science |
| ISBN | 3-319-03898-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Exact Complexity and Satisfiability.- The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.- Parameterized Complexity of Two Edge Contraction Problems with Degree Constraints.- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem -- The Fine Details of Fast Dynamic Programming over Tree Decompositions.- On Subexponential and FPT-Time Inapproximability.- Multi-parameter Complexity Analysis for Constrained Size Graph Problems: Using Greediness for Parameterization.- Chain Minors Are FPT.- Incompressibility of H-Free Edge Modification.- Contracting Few Edges to Remove Forbidden Induced Subgraphs.- Fixed-Parameter and Approximation Algorithms: A New Look.- Subgraphs Satisfying MSO Properties on z-Topologically Orderable Digraphs.- Computing Tree-Depth Faster Than 2n.- Faster Exact Algorithms for Some Terminal Set Problems.- Parameterized Algorithms for Modular-Width.- A Faster FPT Algorithm for Bipartite Contraction.- On the Ordered List Subgraph Embedding Problems.- A Completeness Theory for Polynomial (Turing) Kernelization.- On Sparsification for Computing Treewidth.- The Jump Number Problem: Exact and Parameterized.- On the Hardness of Eliminating Small Induced Subgraphs by Contracting Edges.- Hardness of r-dominating set on Graphs of Diameter (r + 1).- Amalgam Width of Matroids.- On the Parameterized Complexity of Reconfiguration Problems.- FPT Algorithms for Consecutive Ones Submatrix Problems.- Upper Bounds on Boolean-Width with Applications to Exact Algorithms.- Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.- Completeness Results for Parameterized Space Classes.- Treewidth and Pure Nash Equilibria -- Algorithms for k-Internal Out-Branching. |
| Record Nr. | UNINA-9910484535803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||