820 search results - page 36 / 164 » Inducing Temporal Graphs |
125
click to vote
ALGORITHMICA
2010
14 years 10 months ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...
DM
2008
14 years 12 months ago
2008
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
107
click to vote
ISM
2006
IEEE
14 years 11 months ago
2006
IEEE
In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new g...
SAC
2010
ACM
15 years 6 months ago
2010
ACM
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
CIBCB
2008
IEEE
15 years 6 months ago
2008
IEEE
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...