16 search results - page 3 / 4 » NP-completeness results for edge modification problems |
DAM
2008
13 years 5 months ago
2008
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf po...
ALGORITHMICA
2010
13 years 5 months ago
2010
We consider a data-structural problem motivated by version control of a hierarchical directory structure in a system like Subversion. The model is that directories and files can b...
BCB
2010
13 years 24 days ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...
KRDB
1998
13 years 7 months ago
1998
Previous researchers note the problem for semantic optimisation of database queries caused by its production of a large number of semantically equivalent alternative queries, from...
CAD
2004
Springer
13 years 5 months ago
2004
Springer
Boundary representation models reconstructed from 3D range data suffer from various inaccuracies caused by noise in the data and by numerical errors in the model building software...