3267 search results - page 339 / 654 » Generalized quasirandom graphs |
163
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
174
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
177
click to vote
APAL
2008
15 years 6 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
187
click to vote
IEE
2008
15 years 6 months ago
2008
Aspect mining tries to identify crosscutting concerns in the code of existing systems and thus supports their adaption to an aspect-oriented design. A semi-automatic static aspect...
172
click to vote
DAM
2006
15 years 6 months ago
2006
The Satisfactory Partition problem consists in deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neigh...