820 search results - page 17 / 164 » Inducing Temporal Graphs |
COLOGNETWENTE
2009
13 years 9 months ago
2009
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
DM
2007
13 years 8 months ago
2007
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
CIAC
2010
Springer
13 years 5 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
DEXA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we propose the Graphical sEmistructured teMporal data model (GEM), which is based on labeled graphs and allows one to represent in a uniform way semistructu...
HICSS
2006
IEEE
14 years 2 months ago
2006
IEEE
A new model for representing temporal access control policies is introduced. In this model, temporal authorizations are represented by time attributes associated with subjects and...