3757 search results - page 1 / 752 » The overlap number of a graph |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ov...
COCOON
2009
Springer
13 years 12 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
GFKL
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
JGT
2007
13 years 5 months ago
2007
: A (directed) cycle C in a graph is called consistent provided there exists an automorphism of , acting as a 1-step rotation of C. A beautiful but not well-known result of J.H. Co...
FLAIRS
2007
13 years 7 months ago
2007
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...