659 search results - page 20 / 132 » Dynamic Algorithms for Graph Spanners |
165
click to vote
ICDM
2006
IEEE
16 years 15 days ago
2006
IEEE
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
164
Voted
DATE
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a novel algorithm based on dynamic programming with binning to find, subject to a given deadline, the minimum-cost coarse-grain hardware/software partitioning and mappin...
150
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
171
Voted
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We introduce a generic algorithmic technique and apply it on decision and counting versions of graph coloring. Our approach is based on the following idea: either a graph...
142
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
This paper investigates improvements of an online handwriting stroke-order analysis algorithm -- cube search, based on cube graph stroke-order generation model and dynamic program...