↓ Skip to main content

Principles and Practice of Constraint Programming

Overview of attention for book
Cover of 'Principles and Practice of Constraint Programming'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Exploiting Short Supports for Improved Encoding of Arbitrary Constraints into SAT
  3. Altmetric Badge
    Chapter 2 Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints
  4. Altmetric Badge
    Chapter 3 An Adaptive Parallel SAT Solver
  5. Altmetric Badge
    Chapter 4 Improved Linearization of Constraint Programming Models
  6. Altmetric Badge
    Chapter 5 Impact of SAT-Based Preprocessing on Core-Guided MaxSAT Solving
  7. Altmetric Badge
    Chapter 6 Multiobjective Optimization by Decision Diagrams
  8. Altmetric Badge
    Chapter 7 Dependency Schemes in QBF Calculi: Semantics and Soundness
  9. Altmetric Badge
    Chapter 8 The Multirate Resource Constraint
  10. Altmetric Badge
    Chapter 9 The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable
  11. Altmetric Badge
    Chapter 10 Propagation via Kernelization: The Vertex Cover Constraint
  12. Altmetric Badge
    Chapter 11 Breaking Symmetries in Graphs: The Nauty Way
  13. Altmetric Badge
    Chapter 12 Extending Broken Triangles and Enhanced Value-Merging
  14. Altmetric Badge
    Chapter 13 A Bounded Path Propagator on Directed Graphs
  15. Altmetric Badge
    Chapter 14 Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets
  16. Altmetric Badge
    Chapter 15 Interval Constraints with Learning: Application to Air Traffic Control
  17. Altmetric Badge
    Chapter 16 Backdoors to Tractable Valued CSP
  18. Altmetric Badge
    Chapter 17 Monte-Carlo Tree Search for the Maximum Satisfiability Problem
  19. Altmetric Badge
    Chapter 18 A New Approach to Checking the Dynamic Consistency of Conditional Simple Temporal Networks
  20. Altmetric Badge
    Chapter 19 On Finding Minimum Satisfying Assignments
  21. Altmetric Badge
    Chapter 20 Towards a Dynamic Decomposition of CSPs with Separators of Bounded Size
  22. Altmetric Badge
    Chapter 21 Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems
  23. Altmetric Badge
    Chapter 22 A Global Constraint for Closed Frequent Pattern Mining
  24. Altmetric Badge
    Chapter 23 Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
  25. Altmetric Badge
    Chapter 24 Tightening McCormick Relaxations for Nonlinear Programs via Dynamic Multivariate Partitioning
  26. Altmetric Badge
    Chapter 25 Parallel Strategies Selection
  27. Altmetric Badge
    Chapter 26 Learning Parameters for the Sequence Constraint from Solutions
  28. Altmetric Badge
    Chapter 27 The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors
  29. Altmetric Badge
    Chapter 28 Explaining Producer/Consumer Constraints
  30. Altmetric Badge
    Chapter 29 Learning from Learning Solvers
  31. Altmetric Badge
    Chapter 30 On Incremental Core-Guided MaxSAT Solving
  32. Altmetric Badge
    Chapter 31 Modelling and Solving Multi-mode Resource-Constrained Project Scheduling
  33. Altmetric Badge
    Chapter 32 A Nearly Exact Propagation Algorithm for Energetic Reasoning in \(\mathcal O(n^2 \log n)\)
  34. Altmetric Badge
    Chapter 33 Efficient Filtering for the Unary Resource with Family-Based Transition Times
  35. Altmetric Badge
    Chapter 34 A Constraint Programming Approach to Multi-Robot Task Allocation and Scheduling in Retirement Homes
  36. Altmetric Badge
    Chapter 35 Optimal Performance Tuning in Real-Time Systems Using Multi-objective Constrained Optimization
  37. Altmetric Badge
    Chapter 36 SABIO: An Implementation of MIP and CP for Interactive Soccer Queries
  38. Altmetric Badge
    Chapter 37 Constraint Programming Models for Chosen Key Differential Cryptanalysis
  39. Altmetric Badge
    Chapter 38 Solving a Supply-Delivery Scheduling Problem with Constraint Programming
  40. Altmetric Badge
    Chapter 39 Four-Bar Linkage Synthesis Using Non-convex Optimization
  41. Altmetric Badge
    Chapter 40 Using Constraint Programming for the Urban Transit Crew Rescheduling Problem
  42. Altmetric Badge
    Chapter 41 Optimizing Shortwave Radio Broadcast Resource Allocation via Pseudo-Boolean Constraint Solving and Local Search
  43. Altmetric Badge
    Chapter 42 Availability Optimization in Cloud-Based In-Memory Data Grids
  44. Altmetric Badge
    Chapter 43 Online HVAC-Aware Occupancy Scheduling with Adaptive Temperature Control
  45. Altmetric Badge
    Chapter 44 Behavior Identification in Two-Stage Games for Incentivizing Citizen Science Exploration
  46. Altmetric Badge
    Chapter 45 Constraining Redundancy to Improve Protein Docking
  47. Altmetric Badge
    Chapter 46 Guaranteed Weighted Counting for Affinity Computation: Beyond Determinism and Structure
  48. Altmetric Badge
    Chapter 47 Finding Alternative Musical Scales
  49. Altmetric Badge
    Chapter 48 Assisted Lead Sheet Composition Using FlowComposer
  50. Altmetric Badge
    Chapter 49 Enforcing Structure on Temporal Sequences: The Allen Constraint
  51. Altmetric Badge
    Chapter 50 Constraint Programming Approach to the Problem of Generating Milton Babbitt’s All-Partition Arrays
  52. Altmetric Badge
    Chapter 51 A Dynamic Programming-Based MCMC Framework for Solving DCOPs with GPUs
  53. Altmetric Badge
    Chapter 52 Morphing Between Stable Matching Problems
  54. Altmetric Badge
    Chapter 53 Using Graph-Based CSP to Solve the Address Translation Problem
  55. Altmetric Badge
    Chapter 54 Finding Unsatisfiable Cores of a Set of Polynomials Using the Gröbner Basis Algorithm
Attention for Chapter 23: Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Above-average Attention Score compared to outputs of the same age and source (60th percentile)

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
4 Dimensions

Readers on

mendeley
17 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems
Chapter number 23
Book title
Principles and Practice of Constraint Programming
Published in
Lecture notes in computer science, August 2016
DOI 10.1007/978-3-319-44953-1_23
Book ISBNs
978-3-31-944952-4, 978-3-31-944953-1
Authors

Ciaran McCreesh, Samba Ndojh Ndiaye, Patrick Prosser, Christine Solnon, McCreesh, Ciaran, Ndiaye, Samba Ndojh, Prosser, Patrick, Solnon, Christine

Editors

Michel Rueher

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 17 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 17 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 5 29%
Student > Master 3 18%
Professor > Associate Professor 2 12%
Researcher 2 12%
Professor 1 6%
Other 2 12%
Unknown 2 12%
Readers by discipline Count As %
Computer Science 9 53%
Engineering 3 18%
Psychology 1 6%
Mathematics 1 6%
Unknown 3 18%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 16 June 2021.
All research outputs
#7,487,068
of 22,886,568 outputs
Outputs from Lecture notes in computer science
#2,487
of 8,127 outputs
Outputs of similar age
#119,576
of 342,837 outputs
Outputs of similar age from Lecture notes in computer science
#144
of 499 outputs
Altmetric has tracked 22,886,568 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,127 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 342,837 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 50% of its contemporaries.
We're also able to compare this research output to 499 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 60% of its contemporaries.