46 search results - page 3 / 10 » A Discovery Algorithm for Directed Cyclic Graphs |
143
click to vote
ICDM
2009
IEEE
15 years 23 days ago
2009
IEEE
In this paper, we focus on a single graph whose vertices contain a set of quantitative attributes. Several networks can be naturally represented in this complex graph. An example i...
131
click to vote
CG
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
120
click to vote
PVLDB
2010
15 years 1 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
135
click to vote
DSS
2002
15 years 2 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
107
click to vote
AAAI
2004
15 years 4 months ago
2004
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...