1736 search results - page 104 / 348 » The rank-width of Directed Graphs |
138
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
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...
139
click to vote
EDBT
2006
ACM
16 years 4 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
112
click to vote
SGAI
2007
Springer
15 years 10 months ago
2007
Springer
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...
140
click to vote
KES
2004
Springer
15 years 9 months ago
2004
Springer
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 ...
131
click to vote
DAM
2007
15 years 4 months ago
2007
In this paper we define Sturmian graphs and we prove that all of them have a certain “counting” property. We show deep connections between this counting property and two conj...