Sciweavers

CORR
2010
Springer
73views Education» more  CORR 2010»
14 years 16 days ago
On Touching Triangle Graphs
Abstract. In this paper, we consider the problem of representing graphs by triangles whose sides touch. We present linear time algorithms for creating touching triangles representa...
Emden R. Gansner, Yifan Hu, Stephen G. Kobourov
AAAI
2000
14 years 1 months ago
On 2-SAT and Renamable Horn
We introduce new linear time algorithms for satisfiability of binary propositional theories (2-SAT), and for recognition and satisfiability of renamable Horn theories. The algorit...
Alvaro del Val
NIPS
2008
14 years 1 months ago
Scalable Algorithms for String Kernels with Inexact Matching
We present a new family of linear time algorithms based on sufficient statistics for string comparison with mismatches under the string kernels framework. Our algorithms improve t...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
AAAI
2010
14 years 1 months ago
Local Search in Histogram Construction
The problem of dividing a sequence of values into segments occurs in database systems, information retrieval, and knowledge management. The challenge is to select a finite number ...
Felix Halim, Panagiotis Karras, Roland H. C. Yap
SWAT
1994
Springer
130views Algorithms» more  SWAT 1994»
14 years 4 months ago
Dominating Cliques in Distance-Hereditary Graphs
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
Feodor F. Dragan
WADS
1997
Springer
88views Algorithms» more  WADS 1997»
14 years 4 months ago
Finding Cores of Limited Length
In this paper we consider the problem of nding a core of limited length in a tree. A core is a path, which minimizes the sum of the distances to all nodes in the tree. This proble...
Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlu...
IWPEC
2004
Springer
14 years 5 months ago
Computing Small Search Numbers in Linear Time
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
Hans L. Bodlaender, Dimitrios M. Thilikos
ICPR
2008
IEEE
14 years 6 months ago
Linear time recognition algorithms for topological invariants in 3D
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
Li Chen, Yongwu Rong
PODS
2002
ACM
138views Database» more  PODS 2002»
15 years 17 days ago
Fast Algorithms For Hierarchical Range Histogram Construction
Data Warehousing and OLAPapplications typically view data as having multiple logical dimensions e.g., product, location with natural hierarchies de ned on each dimension. OLAP que...
Sudipto Guha, Nick Koudas, Divesh Srivastava