803 search results - page 69 / 161 » Independence in Direct-Product Graphs |
76
Voted
ICDM
2008
IEEE
15 years 7 months ago
2008
IEEE
In graph mining, a frequency measure is anti-monotonic if the frequency of a pattern never exceeds the frequency of a subpattern. The efficiency and correctness of most graph pat...
112
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
158
Voted
GPC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Large-scale distributed computing applications require concurrent programming models that support modular and compositional software development. The actor model supports...
100
Voted
CPC
2007
15 years 21 days ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
112
Voted
SOSYM
2010
14 years 11 months ago
2010
In this paper we present an approach for the analysis of graph transformation rules based on an intermediate OCL representation. We translate different rule semantics into OCL, to...