321 search results - page 2 / 65 » Partitioning by iterative deletion |
ADT
2005
13 years 5 months ago
2005
Coding for channels with synchronization errors is studied. Marker codes, each consisting of a low-density parity-check code with inserted markers, are developed. At low insertion...
SISW
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper describes a system that supports high availability of data, until the data should be expunged, at which time it is impossible to recover the data. This design supports ...
MST
2010
13 years 3 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
WEA
2007
Springer
13 years 11 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
WG
2007
Springer
13 years 11 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...