17 search results - page 1 / 4 » The computational complexity of graph contractions I: Polyno... |
NETWORKS
2008
13 years 5 months ago
2008
NETWORKS
2008
13 years 5 months ago
2008
WG
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
DISOPT
2011
12 years 8 months ago
2011
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional poi...