2487 search results - page 264 / 498 » Partitions of Graphs into Trees |
123
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
104
click to vote
DAM
2008
15 years 3 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...
153
click to vote
DASFAA
2003
IEEE
15 years 9 months ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
149
click to vote
COMAD
2008
15 years 5 months ago
2008
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
118
click to vote
CIIT
2004
15 years 5 months ago
2004
In the current information age, the dominant method for information search is by providing few keywords to a search engine. Keyword search is currently one of the most important o...