Sciweavers

820 search results - page 36 / 164
» Inducing Temporal Graphs
Sort
View
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 6 months ago
Deciding k-Colorability of P5-Free Graphs in Polynomial Time
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...
Chính T. Hoàng, Marcin Kaminski, Vad...
DM
2008
95views more  DM 2008»
13 years 8 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
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...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...
ISM
2006
IEEE
129views Multimedia» more  ISM 2006»
13 years 8 months ago
A Graph-Based Approach for Modeling and Indexing Video Data
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...
JeongKyu Lee
SAC
2010
ACM
14 years 3 months ago
Mining temporal relationships among categories
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...
Saket S. R. Mengle, Nazli Goharian
CIBCB
2008
IEEE
14 years 2 months ago
Temporal and structural analysis of biological networks in combination with microarray data
— 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...
Chang Hun You, Lawrence B. Holder, Diane J. Cook