An Efficient Algorithm for Enumerating Chordless Cycles and Chordless Paths

A chordless cycle (induced cycle) $C$ of a graph is a cycle without any chord, meaning that there is no edge outside the cycle connecting two vertices of the cycle. A chordless path is defined similarly. In this paper, we consider the problems of enumerating chordless cycles/paths of a given graph $G=(V,E),$ and propose algorithms taking $O(|E|)$ time for each chordless cycle/path. In the existing studies, the problems had not been deeply studied in the theoretical computer science area, and no output polynomial time algorithm has been proposed. Our experiments showed that the computation time of our algorithms is constant per chordless cycle/path for non-dense random graphs and real-world graphs. They also show that the number of chordless cycles is much smaller than the number of cycles. We applied the algorithm to prediction of NMR (Nuclear Magnetic Resonance) spectra, and increased the accuracy of the prediction

Geometry of tropical moduli spaces and linkage of graphs

We prove the following "linkage" theorem: two p-regular graphs of the same genus can be obtained from one another by a finite alternating sequence of one-edge-contractions; moreover this preserves 3-edge-connectivity. We use the linkage theorem to prove that various moduli spaces of tropical curves are connected through codimension one.Comment: Final version incorporating the referees correction

Moduli space actions on the Hochschild Co-Chains of a Frobenius algebra I: Cell Operads

This is the first of two papers in which we prove that a cell model of the moduli space of curves with marked points and tangent vectors at the marked points acts on the Hochschild co--chains of a Frobenius algebra. We also prove that a there is dg--PROP action of a version of Sullivan Chord diagrams which acts on the normalized Hochschild co-chains of a Frobenius algebra. These actions lift to operadic correlation functions on the co--cycles. In particular, the PROP action gives an action on the homology of a loop space of a compact simply--connected manifold. In this first part, we set up the topological operads/PROPs and their cell models. The main theorems of this part are that there is a cell model operad for the moduli space of genus $g$ curves with $n$ punctures and a tangent vector at each of these punctures and that there exists a CW complex whose chains are isomorphic to a certain type of Sullivan Chord diagrams and that they form a PROP. Furthermore there exist weak versions of these structures on the topological level which all lie inside an all encompassing cyclic (rational) operad.Comment: 50 pages, 7 figures. Newer version has minor changes. Some material shifted. Typos and small things correcte

Topology of two-connected graphs and homology of spaces of knots

We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we define the higher indices, which invariants of knots in $\R^3$ define at arbitrary singular knots. More generally, for any finite-order cohomology class of the space of knots we define its principal symbol, which lies in a cohomology group of a certain finite-dimensional configuration space and characterizes our class modulo the classes of smaller filtration