4171 search results - page 353 / 835 » Choice numbers of graphs |
181
click to vote
LATIN
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. We introduce the NP-hard graph-based data clustering problem s-Plex Cluster Vertex Deletion, where the task is to delete at most k vertices from a graph so that the conne...
151
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
161
click to vote
CSMR
2008
IEEE
16 years 1 months ago
2008
IEEE
Databases are continuously evolving environments, where design constructs are added, removed or updated rather often. Small changes in the database configurations might impact a l...
177
click to vote
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...
162
click to vote
GD
2007
Springer
16 years 1 months ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...