The Resource Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, edited by Venkatesh Raman, Saket Saurabh, (electronic resource)

Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, edited by Venkatesh Raman, Saket Saurabh, (electronic resource)

Label
Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings
Title
Parameterized and Exact Computation
Title remainder
5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings
Statement of responsibility
edited by Venkatesh Raman, Saket Saurabh
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Is Subseries of
Dewey number
511.352
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • g-Ve68Iuix0
  • RxhTFZEupy4
Image bit depth
0
Language note
English
LC call number
QA76.9.A43
Literary form
non fiction
http://library.link/vocab/relatedWorkOrContributorName
  • IPEC (Symposium)
  • Raman, Venkatesh.
  • Saurabh, Saket.
Series statement
Theoretical Computer Science and General Issues
Series volume
6478
http://library.link/vocab/subjectName
  • Algorithms
  • Computer science—Mathematics
  • Computers
  • Algorithm Analysis and Problem Complexity
  • Algorithms
  • Discrete Mathematics in Computer Science
  • Theory of Computation
  • Symbolic and Algebraic Manipulation
  • Computation by Abstract Devices
Label
Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, edited by Venkatesh Raman, Saket Saurabh, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
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
Dimensions
unknown
Edition
1st ed. 2010.
Extent
1 online resource (X, 239 p. 18 illus.)
File format
multiple file formats
Form of item
online
Isbn
9786613568519
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-642-17493-3
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)2670000000064708
  • (SSID)ssj0000476519
  • (PQKBManifestationID)11284241
  • (PQKBTitleCode)TC0000476519
  • (PQKBWorkID)10480245
  • (PQKB)10305176
  • (DE-He213)978-3-642-17493-3
  • (EXLCZ)992670000000064708
Label
Parameterized and Exact Computation : 5th International Symposium, IPEC 2010, Chennai, India, December 13-15, 2010. Proceedings, edited by Venkatesh Raman, Saket Saurabh, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
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
Dimensions
unknown
Edition
1st ed. 2010.
Extent
1 online resource (X, 239 p. 18 illus.)
File format
multiple file formats
Form of item
online
Isbn
9786613568519
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-3-642-17493-3
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)2670000000064708
  • (SSID)ssj0000476519
  • (PQKBManifestationID)11284241
  • (PQKBTitleCode)TC0000476519
  • (PQKBWorkID)10480245
  • (PQKB)10305176
  • (DE-He213)978-3-642-17493-3
  • (EXLCZ)992670000000064708

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...