Sciweavers

1756 search results - page 89 / 352
» Directed scale-free graphs
Sort
View
ICALP
2007
Springer
14 years 2 months ago
Parameterized Approximability of the Disjoint Cycle Problem
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
Martin Grohe, Magdalena Grüber
EDBT
2006
ACM
174views Database» more  EDBT 2006»
14 years 8 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...
JAIR
2000
94views more  JAIR 2000»
13 years 7 months ago
Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Subbarao Kambhampati
SGAI
2007
Springer
14 years 2 months ago
Visualization and Grouping of Graph Patterns in Molecular Databases
Mining subgraphs is an area of research where we have a given set of graphs, and we search for (connected) subgraphs contained in these graphs. In this paper we focus on the analy...
Edgar H. de Graaf, Walter A. Kosters, Joost N. Kok...
KES
2004
Springer
14 years 1 months ago
Consumer Behavior Analysis by Graph Mining Technique
In this paper we discuss how graph mining system is applied to sales transaction data so as to understand consumer behavior. First, existing research of consumer behavior analysis ...
Katsutoshi Yada, Hiroshi Motoda, Takashi Washio, A...