820 search results - page 47 / 164 » Inducing Temporal Graphs |
ENTCS
2008
13 years 8 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
IPL
2007
13 years 8 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
GC
2010
Springer
13 years 7 months ago
2010
Springer
A directed graph has a natural Z-module homomorphism from the underlying graph’s cycle space to Z where the image of an oriented cycle is the number of forward edges minus the n...
JCT
2010
13 years 7 months ago
2010
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...