57 search results - page 7 / 12 » Inapproximability of the Tutte polynomial |
91
Voted
ICALP
2010
Springer
15 years 3 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
130
Voted
CSL
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The notion of graph polynomials definable in Monadic Second Order Logic, MSOL, was introduced in [Mak04]. It was shown that the Tutte polynomial and its generalization, a...
140
Voted
COLOGNETWENTE
2010
15 years 13 days ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...
95
Voted
APPROX
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
123
click to vote
ISAAC
2004
Springer
15 years 7 months ago
2004
Springer
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...