1242 search results - page 90 / 249 » A Computational Complexity Theory in Membrane Computing |
103
click to vote
COMPGEOM
2010
ACM
15 years 3 months 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 ...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
DAGSTUHL
2010
14 years 11 months ago
2010
Visualizations are well suited to communicate large amounts of complex data. With increasing resolution in the spatial and temporal domain simple imaging techniques meet their lim...
CCS
2007
ACM
15 years 4 months ago
2007
ACM
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
MOBICOM
2012
ACM
13 years 15 days ago
2012
ACM
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...