820 search results - page 74 / 164 » Inducing Temporal Graphs |
138
Voted
IDA
2009
Springer
15 years 8 days ago
2009
Springer
In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possibl...
177
Voted
ICDM
2009
IEEE
15 years 9 days ago
2009
IEEE
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
115
Voted
IADIS
2008
15 years 4 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
130
Voted
ALGORITHMICA
2006
15 years 2 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
128
Voted
COMBINATORICA
2006
15 years 2 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...