Sciweavers

677 search results - page 56 / 136
» Bipartite roots of graphs
Sort
View
ICALP
2005
Springer
14 years 4 months ago
Stochastic Steiner Trees Without a Root
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
Anupam Gupta, Martin Pál
JCB
2006
115views more  JCB 2006»
13 years 11 months ago
Designing an A* Algorithm for Calculating Edit Distance between Rooted-Unordered Trees
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
Yair Horesh, Ramit Mehr, Ron Unger
FQAS
2006
Springer
106views Database» more  FQAS 2006»
14 years 2 months ago
A Functional Model for Data Analysis
We present a functional model for the analysis of large volumes of detailed transactional data, accumulated over time. In our model, the data schema is an acyclic graph with a sing...
Nicolas Spyratos
AMAI
2005
Springer
13 years 11 months ago
Generalizations of matched CNF formulas
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
Stefan Szeider
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
14 years 11 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao