2487 search results - page 171 / 498 » Partitions of Graphs into Trees |
CPC
2006
15 years 3 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...
109
click to vote
JGT
2010
15 years 2 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...
112
Voted
COLING
2010
14 years 10 months ago
2010
This paper describes the participation of RelaxCor in the Semeval-2010 task number 1: "Coreference Resolution in Multiple Languages". RelaxCor is a constraint-based grap...
134
Voted
GECCO
2000
Springer
15 years 7 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...
139
Voted
WG
1993
Springer
15 years 7 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...