16 search results - page 2 / 4 » NP-completeness results for edge modification problems |
DASFAA
2011
IEEE
13 years 2 months ago
2011
IEEE
\Identity disclosure" problem on publishing social network data has gained intensive focus from academia. Existing k-anonymization algorithms on social network may result in n...
BMCBI
2008
13 years 5 months ago
2008
Background: The reconstruction of genetic regulatory networks from microarray gene expression data has been a challenging task in bioinformatics. Various approaches to this proble...
ICIP
1997
IEEE
14 years 6 months ago
1997
IEEE
Anisotropic diffusion is a powerful method for image feature extraction in which blurring is allowed to occur except at edges. Mean field annealing (MFA) is an image optimization ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in g...
ASPDAC
2001
ACM
13 years 9 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...