820 search results - page 27 / 164 » Inducing Temporal Graphs |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...
VLDB
1993
ACM
14 years 15 days ago
1993
ACM
The enforcement of semantic integrity constraints in data and knowledge bases constitutea a major performance bottleneck. Integrity constraint simplification methods aim at reduci...
SIGCOMM
2009
ACM
14 years 3 months ago
2009
ACM
We describe a new model for studying intermittently connected mobile networks, based on Markovian random temporal graphs, that captures the influence of message size, maximum tol...
COCOON
2006
Springer
14 years 5 days ago
2006
Springer
We determine the values of the acyclic chromatic index of a class of graphs referred to as d-dimensional partial tori. These are graphs which can be expressed as the cartesian prod...
CJCDGCGT
2005
Springer
13 years 10 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...