Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings / / edited by Venkatesh Raman, Saket Saurabh
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings / / edited by Venkatesh Raman, Saket Saurabh
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Edizione: | 1st ed. 2010. |
| Descrizione fisica: | 1 online resource (X, 239 p. 18 illus.) |
| Disciplina: | 511.352 |
| Soggetto topico: | Algorithms |
| Computer science—Mathematics | |
| Discrete mathematics | |
| Computer science | |
| Discrete Mathematics in Computer Science | |
| Theory of Computation | |
| Symbolic and Algebraic Manipulation | |
| Persona (resp. second.): | RamanV <1962-> (Venkatesh) |
| SaurabhSaket | |
| Note generali: | Bibliographic Level Mode of Issuance: Monograph |
| Nota di contenuto: | The Complexity of Satisfaction on Sparse Graphs -- Protrusions in Graphs and Their Applications -- Parameterized Complexity Results in Symmetry Breaking -- On the Kernelization Complexity of Colorful Motifs -- Partial Kernelization for Rank Aggregation: Theory and Experiments -- Enumerate and Measure: Improving Parameter Budget Management -- On the Exact Complexity of Evaluating Quantified k-CNF -- Cluster Editing: Kernelization Based on Edge Cuts -- Computing the Deficiency of Housing Markets with Duplicate Houses -- A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Application -- An Improved FPT Algorithm and Quadratic Kernel for Pathwidth One Vertex Deletion -- Multivariate Complexity Analysis of Swap Bribery -- Parameterizing by the Number of Numbers -- Are There Any Good Digraph Width Measures? -- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems -- Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming -- On the Grundy Number of a Graph -- Exponential Time Complexity of Weighted Counting of Independent Sets -- The Exponential Time Complexity of Computing the Probability That a Graph Is Connected -- Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting -- Small Vertex Cover Makes Petri Net Coverability and Boundedness Easier -- Proper Interval Vertex Deletion. |
| Titolo autorizzato: | Parameterized and Exact Computation |
| ISBN: | 1-280-39059-X |
| 9786613568519 | |
| 3-642-17493-0 | |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 9910484011103321 |
| Lo trovi qui: | Univ. Federico II |
| Opac: | Controlla la disponibilità qui |
Serie:
Theoretical Computer Science and General Issues, . 2512-2029 ; ; 6478