2446 search results - page 69 / 490 » Choiceless Polynomial Time |
113
click to vote
SIAMCOMP
1998
14 years 11 months ago
1998
Polynomial-time safe and unsafe approximations for intractable sets were introduced by Meyer and Paterson [Technical Report TM-126, Laboratory for Computer Science, MIT, Cambridge,...
IJFCS
2010
14 years 10 months ago
2010
PVLDB
2010
14 years 10 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
125
click to vote
ALGORITHMICA
2010
14 years 10 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
115
click to vote
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...