Parameterized and Exact Computation [electronic resource] : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings / edited by Venkatesh Raman, Saket Saurabh.
Material type: TextSeries: Lecture Notes in Computer Science ; 6478Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: X, 239p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642174933Subject(s): Computer science | Information theory | Computer software | Computational complexity | Algebra -- Data processing | Algorithms | Computer Science | Algorithm Analysis and Problem Complexity | Algorithms | Discrete Mathematics in Computer Science | Theory of Computation | Symbolic and Algebraic Manipulation | Computation by Abstract DevicesAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access onlineCurrent library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
IMSc Library | IMSc Library | Link to resource | Available | EBK9445 |
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.
There are no comments on this title.