Sciweavers

355 search results - page 38 / 71
» On Central Spanning Trees of a Graph
Sort
View
WWW
2007
ACM
15 years 10 months ago
A link classification based approach to website topic hierarchy generation
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
Nan Liu, Christopher C. Yang
ISMB
1993
14 years 11 months ago
Computationally Efficient Cluster Representation in Molecular Sequence Megaclassification
Molecular sequence megaclassification is a technique for automated protein sequence analysis and annotation. Implementation of the method has been limited by the need to store and...
David J. States, Nomi L. Harris, Lawrence Hunter
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
15 years 10 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
COMPGEOM
1993
ACM
15 years 2 months ago
Worst-Case Bounds for Subadditive Geometric Graphs
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
Marshall W. Bern, David Eppstein
SIGMOD
2010
ACM
239views Database» more  SIGMOD 2010»
15 years 2 months ago
Computing label-constraint reachability in graph databases
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yan...