Related papers: Computing eulerian magnitude homology
Magnitude homology is a bigraded homology theory for finite graphs defined by Hepworth and Willerton, categorifying the power series invariant known as magnitude which was introduced by Leinster. We analyze the structure and implications of…
We present a mathematical framework for describing the topology of configuration spaces for particles on one-connected graphs. In particular, we compute the homology groups over integers for different classes of one-connected graphs. Our…
The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this note we present the first exact algorithm for the minimum rank…
We define and study the magnitude and magnitude homology of a real hyperplane arrangement by regarding its tope graph as a metric space. We prove several structural results for the magnitude of arrangements, including a symmetry formula,…
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive…
Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum…
Computing the diameter, and more generally, all eccentricities of an undirected graph is an important problem in algorithmic graph theory and the challenge is to identify graph classes for which their computation can be achieved in…
The Euler characteristic is an invariant of a topological space that in a precise sense captures its canonical notion of size, akin to the cardinality of a set. The Euler characteristic is closely related to the homology of a space, as it…
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…
We study the homology groups of the complement of a complexified real line arrangement with coefficients in complex rank-one local systems. Using Borel--Moore homology, we establish an algorithm computing their dimensions via the real…
We show that counting Euler tours in undirected bounded tree-width graphs is tractable even in parallel - by proving a $\#SAC^1$ upper bound. This is in stark contrast to #P-completeness of the same problem in general graphs. Our main…
The Euler genus of a graph is a fundamental and well-studied parameter in graph theory and topology. Computing it has been shown to be NP-hard by [Thomassen '89 & '93], and it is known to be fixed-parameter tractable. However, the…
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
Let G be a linear algebraic group, not necessarily connected or reductive, over the field of real numbers R. We describe a method, implemented on computer, to find the first Galois cohomology set H^1(R,G). The output is a list of 1-cocycles…
Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…
Our starting point is the observation that if graphs in a class C have low descriptive complexity in first order logic, then the isomorphism problem for C is solvable by a fast parallel algorithm (essentially, by a simple combinatorial…
We present a fast algorithm for computing discrete cubical homology of graphs over finite fields with an appropriate characteristic. This algorithm improves on several computational steps compared to constructions in the existing…
We give the first tractable and systematic examples of nontrivial higher digraph homotopy groups. To do this we define relative digraph homotopy groups and show these satisfy a long exact sequence analogous to the relative homotopy groups…
Two fundamental algorithm-design paradigms are Tree Search and Dynamic Programming. The techniques used therein have been shown to complement one another when solving the complete set partitioning problem, also known as the coalition…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…