Related papers: A search method for thin positions of links
We explore the application of automated reasoning techniques to unknot detection, a classical problem of computational topology. We adopt a two-pronged experimental approach, using a theorem prover to try to establish a positive result…
In this paper we consider the problem of connected edge searching of weighted trees. It is shown that there exists a polynomial-time algorithm for finding optimal connected search strategy for bounded degree trees with arbitrary weights on…
The article contains the algorithm for searching a certain kind of bridges in the protection graph of Take-Grant model. The proposed algorithm is based on a classical breadth-first search algorithm.
The article describes information model and the method for searching patent analogs for Personal Research Information System.
In this paper we explore a new method of analysis of associative algebras.
Link prediction is a common problem in network science that transects many disciplines. The goal is to forecast the appearance of new links or to find links missing in the network. Typical methods for link prediction use the topology of the…
An approximate textual retrieval algorithm for searching sources with high levels of defects is presented. It considers splitting the words in a query into two overlapping segments and subsequently building composite regular expressions…
Can a Web crawler efficiently locate an unknown relevant page? While this question is receiving much empirical attention due to its considerable commercial value in the search engine community [Cho98,Chakrabarti99,Menczer00,Menczer01],…
In this paper we provide an overview of a series of recent results regarding algorithms for searching for subsequences in words or for the analysis of the sets of subsequences occurring in a word.
We construct a pair of isotopic link configurations that are not thick isotopic while preserving total length.
In this paper, we proposed the \textit{link injection}, a novel method that helps any differentiable graph machine learning models to go beyond observed connections from the input data in an end-to-end learning fashion. It finds out (weak)…
The internet is considered as the most extensive market in the world. To keep its gradual reputation, it must confront real problems that result from its distribution and from the diversity of the protocols used to insure communications.…
Link prediction is one of the fundamental problems in computational social science. A particularly common means to predict existence of unobserved links is via structural similarity metrics, such as the number of common neighbors; node…
In math.GT/0106017 it was shown that thin position on Heegaard spines can be a useful tool for analyzing the topology of knots in 3-space. The proof there (specifically, of the Goda-Teragaito conjecture) requires masses of technical detail;…
A weak chord index $Ind'$ is constructed for self crossing points of virtual links. Then a new writhe polynomial $W$ of virtual links is defined by using $Ind'$. $W$ is a generalization of writhe polynomial defined in [6]. Based on $W$,…
We propose an algorithm to locate the most critical nodes to network robustness. Such critical nodes may be thought of as those most related to the notion of network centrality. Our proposal relies only on a localized spectral analysis of a…
We construct a weak Hilbert space that is a twisted Hilbert space.
Abby Thompson proved that if a link $K$ is in thin position but not in bridge position then the knot complement contains an essential meridional planar surface, and she asked whether some thin level surface must be essential. This note is…
We discuss weak and strong links (`virtual connections') in the Shannon game. General properties of these links are discussed, leading to a method to find all links of given size by a suitably pruned exhaustive search. This is applied to…
We are given the adjacency matrix of a geometric graph and the task of recovering the latent positions. We study one of the most popular approaches which consists in using the graph distances and derive error bounds under various…