1461 search results - page 30 / 293 » Complexity of Graph Covering Problems |
DLT
2007
13 years 9 months ago
2007
Abstract. Inapproximability results concerning minimization of nondeterministic finite automata relative to given deterministic finite automata were obtained only recently, modul...
APPROX
2005
Springer
14 years 1 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
JMLR
2010
13 years 2 months ago
2010
In this paper we address the problem of predicting when the available data is incomplete. We show that changing the generally accepted table-wise view of the sample items into a g...
MST
2008
13 years 7 months ago
2008
Abstract. We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generaliz...
CC
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...