1162 search results - page 161 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
ACL
1994
13 years 9 months ago
1994
This article outlines a new method of locating discourse boundaries based on lexical cohesion and a graphical technique called dotplotting. The application of dotplotting to disco...
GD
2003
Springer
14 years 1 months ago
2003
Springer
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
STOC
2010
ACM
14 years 28 days ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...
WWW
2011
ACM
13 years 3 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
SBBD
2003
13 years 9 months ago
2003
A common requirement of many scientific applications is the ability to process queries involving expensive predicates corresponding to user programs. Optimizing such queries is ha...