482 search results - page 52 / 97 » A Linear-Time Graph Kernel |
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
The development of street-level geoviewers become recently a very active and challenging research topic. In this context, the detection, representation and classification of windo...
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In an increasing number of domains such as bioinformatics, combinatorial graph problems arise. We propose a novel way to solve these problems, mainly those that can be tr...
HIPC
2005
Springer
15 years 3 months ago
2005
Springer
Graph theoretic problems are representative of fundamental computations in traditional and emerging scientific disciplines like scientific computing, computational biology and b...
SODA
2012
ACM
13 years 6 days ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...