1545 search results - page 86 / 309 » On tree congestion of graphs |
106
click to vote
POPL
1993
ACM
15 years 2 months ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
CPC
2006
14 years 10 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
JGT
2010
14 years 8 months ago
2010
: We prove that the strong product G1 G2 of G1 and G2 is Z3-flow contractible if and only if G1 G2 is not T K2, where T is a tree (we call T K2 a K4-tree). It follows that G1 G2 ad...
GECCO
2000
Springer
15 years 1 months ago
2000
Springer
We generalize Holland's Schema Theorem to the setting that genes are arranged, not necessarily in a linear sequence, but as the nodes in a connected graph. We have experiment...