882 search results - page 117 / 177 » On the Hardness of Graph Isomorphism |
GD
2005
Springer
14 years 2 months ago
2005
Springer
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
SAT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
VLSID
2002
IEEE
14 years 1 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
FOCS
2000
IEEE
14 years 10 days ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
AAAI
2010
13 years 10 months ago
2010
We consider optimizing the coalition structure in Coalitional Skill Games (CSGs), a succinct representation of coalitional games (Bachrach and Rosenschein 2008). In CSGs, the valu...