2398 search results - page 16 / 480 » Constraint Programming and Graph Algorithms |
123
Voted
CP
2006
Springer
15 years 10 months ago
2006
Springer
272
Voted
DC
2011
14 years 6 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
171
Voted
AI
2010
Springer
15 years 6 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
147
click to vote
SCAM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents and evaluates a number of techniques to improve the execution time of interprocedural pointer analysis in the context of large C programs. The analysis is form...