1963 search results - page 136 / 393 » The Maximum Solution Problem on Graphs |
STTT
2010
13 years 8 months ago
2010
Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper, we show that Kermeta is relatively suitable f...
ATAL
2008
Springer
14 years 2 days ago
2008
Springer
Complete algorithms have been proposed to solve problems modelled as distributed constraint optimization (DCOP). However, there are only few attempts to address real world scenari...
SAC
2011
ACM
13 years 27 days ago
2011
ACM
Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
FLAIRS
2006
13 years 11 months ago
2006
Decision support systems that capture, preserve, and reuse implicit knowledge can greatly benefit from explicitly using context. The development of this type of system can benefit...
ANOR
2005
13 years 10 months ago
2005
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...