Related papers: Algorithms for Tverberg's theorem via centerpoint …
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
The vertex cover problem is a fundamental and widely studied combinatorial optimization problem. It is known that its standard linear programming relaxation is integral for bipartite graphs and half-integral for general graphs. As a…
We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…
This work introduces and compares approaches for estimating rare-event probabilities related to the number of edges in the random geometric graph on a Poisson point process. In the one-dimensional setting, we derive closed-form expressions…
Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the…
Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…
A simple algorithm and a computational program to numerically compute the electric field gradient and the concomitant quadrupolar nuclear splitting is developed for an arbitrary ionic crystal. The calculations are performed using a point…
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mining. A measure that is gaining attention is forest…
We present a learning-based approach to computing solutions for certain NP-hard problems. Our approach combines deep learning techniques with useful algorithmic elements from classic heuristics. The central component is a graph…
An original approach to solving rather difficult probabilistic problems arising in studying the readout of random discrete fields and having no exact analytical solutions at the moment is proposed. Several algorithms for direct, iterative,…
We study the convergence of the Riemannian steepest descent algorithm on the Grassmann manifold for minimizing the block version of the Rayleigh quotient of a symmetric matrix. Even though this problem is non-convex in the Euclidean sense…
In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…
We consider a class of nonsmooth fractional programming problems with fixed-point constraints, where the numerator is convex and the denominator is concave. To solve this problem, we propose splitting algorithms that compute subgradient…
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
Induced bipartite subgraphs of maximal vertex cardinality are an essential concept for the analysis of graphs. Yet, discovering them in large graphs is known to be computationally hard. Therefore, we consider in this work a weaker notion of…
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
An algorithm, based on numerical description of the terms of many-body perturbation theory (Goldstone diagrams), is presented. The algorithm allows the use of the same piece of computer code to evaluate any particular diagram in any…
The efficiency of graph-based semi-supervised algorithms depends on the graph of instances on which they are applied. The instances are often in a vectorial form before a graph linking them is built. The construction of the graph relies on…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
We introduce a new ``Winding Number Conjecture'' about maps from the $(d-1)$-skeleton of the $((d+1)(q-1))$-simplex into $\real^d$. This conjecture is equivalent to the Topological Tverberg Theorem. Furthermore, many statements about the…