281 search results - page 16 / 57 » The Complexity of Planar Counting Problems |
KDD
1998
ACM
13 years 12 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
WG
2005
Springer
14 years 1 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
COMPGEOM
2010
ACM
14 years 25 days ago
2010
ACM
A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show that it is NP-hard to compute the crossing number of near-planar graphs. The main idea ...
COCO
2007
Springer
14 years 1 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
NN
1998
Springer
13 years 7 months ago
1998
Springer
For complex database prediction problems such as medical diagnosis, the ARTMAP-IC neural network adds distributed prediction and category instance counting to the basic fuzzy ARTM...