Sciweavers

820 search results - page 23 / 164
» Inducing Temporal Graphs
Sort
View
JDA
2006
98views more  JDA 2006»
13 years 8 months ago
Completely connected clustered graphs
Abstract. Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the p...
Sabine Cornelsen, Dorothea Wagner
CORR
1999
Springer
145views Education» more  CORR 1999»
13 years 8 months ago
Subgraph Isomorphism in Planar Graphs and Related Problems
We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph ...
David Eppstein
JGT
2006
114views more  JGT 2006»
13 years 8 months ago
The chromatic covering number of a graph
Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, ...
Reza Naserasr, Claude Tardif
JAIR
2011
84views more  JAIR 2011»
13 years 3 months ago
Evaluating Temporal Graphs Built from Texts via Transitive Reduction
Temporal information has been the focus of recent attention in information extraction, leading to some standardization effort, in particular for the task of relating events in a t...
Xavier Tannier, Philippe Muller
ISI
2006
Springer
13 years 8 months ago
An Embedded Bayesian Network Hidden Markov Model for Digital Forensics
In the paper we combine a Bayesian Network model for encoding forensic evidence during a given time interval with a Hidden Markov Model (EBN-HMM) for tracking and predicting the de...
Olivier Y. de Vel, Nianjun Liu, Terry Caelli, Tib&...