نتایج جستجو برای: graph embedding
تعداد نتایج: 264869 فیلتر نتایج به سال:
In contrast with knots, whose properties depend only on their extrinsic topology in S3, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in S3. For example, it was shown by Conway and Gordon that every embedding of the complete graph K7 in S3 contains a non-trivial knot. Later it was shown that for every m ∈ N there i...
In contrast with knots, whose properties depend only on their extrinsic topology in S3, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in S3. For example, it was shown by Conway and Gordon that every embedding of the complete graph K7 in S3 contains a non-trivial knot. Later it was shown that for every m ∈ N there i...
In part I, we showed that there was an infinite family of graphs not embeddable in the torus in such a way that a free action of any group on any of the graphs extends to a cellular automorphism of the torus. We used a homologically-driven analysis of ordinary voltage graph embeddings. An ordinary voltage graph embedding with voltage group A in a surface encodes a derived embedding of a derived...
In the literature, although structural representations (e.g. graph) are more powerful than feature vectors in terms of representational abilities, many robust and efficient methods for classification (unsupervised and supervised) have been developed for feature vector representations. In this paper, we propose a graph embedding technique based on the constant shift embedding which transforms a ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید