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.
Parameterized and Exact Computation [[electronic resource] ] : Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings / / edited by Martin Grohe, Rolf Niedermeier
| Parameterized and Exact Computation [[electronic resource] ] : Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings / / edited by Martin Grohe, Rolf Niedermeier |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 227 p.) |
| Disciplina | 530.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-540-79723-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters -- Algorithmic Graph Minors and Bidimensionality -- Algorithmic Meta-theorems -- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem -- Fixed Structure Complexity -- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees -- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs -- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem -- Capacitated Domination and Covering: A Parameterized Perspective -- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems -- A Purely Democratic Characterization of W[1] -- Parameterized Complexity and Approximability of the SLCS Problem -- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs -- Wheel-Free Deletion Is W[2]-Hard -- Parameterized Derandomization -- A Linear Kernel for Planar Feedback Vertex Set -- Parameterized Chess -- The Time Complexity of Constraint Satisfaction -- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances -- Exact Algorithms for Edge Domination. |
| Record Nr. | UNISA-996465319103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Parameterized and Exact Computation : Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings / / edited by Martin Grohe, Rolf Niedermeier
| Parameterized and Exact Computation : Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008, Proceedings / / edited by Martin Grohe, Rolf Niedermeier |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (X, 227 p.) |
| Disciplina | 530.11 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Artificial intelligence—Data processing Computer science—Mathematics Discrete mathematics Theory of Computation Data Science Discrete Mathematics in Computer Science |
| ISBN | 3-540-79723-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters -- Algorithmic Graph Minors and Bidimensionality -- Algorithmic Meta-theorems -- Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem -- Fixed Structure Complexity -- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees -- An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs -- New Fixed-Parameter Algorithms for the Minimum Quartet Inconsistency Problem -- Capacitated Domination and Covering: A Parameterized Perspective -- Some Fixed-Parameter Tractable Classes of Hypergraph Duality and Related Problems -- A Purely Democratic Characterization of W[1] -- Parameterized Complexity and Approximability of the SLCS Problem -- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs -- Wheel-Free Deletion Is W[2]-Hard -- Parameterized Derandomization -- A Linear Kernel for Planar Feedback Vertex Set -- Parameterized Chess -- The Time Complexity of Constraint Satisfaction -- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances -- Exact Algorithms for Edge Domination. |
| Record Nr. | UNINA-9910483024603321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||