Related papers: Algorithms for Enumerating Balanced Tanner Graphs
We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
This report presents an algorithm to statically schedule live and strongly connected Marked Graphs (MG). The proposed algorithm computes the best execution where the execution rate is maximal and place sizes are minimal. The proposed…
Temporal graphs represent graph evolution over time, and have been receiving considerable research attention. Work on expressing temporal graph patterns or discovering temporal motifs typically assumes relatively simple temporal…
In this paper, we consider the problem of counting and sampling structures in graphs. We define a class of "edge universal labeling problems"---which include proper $k$-colorings, independent sets, and downsets---and describe simple…
Finding Minimal Unsatisfiable Subsets (MUSes) of binary constraints is a common problem in infeasibility analysis of over-constrained systems. However, because of the exponential search space of the problem, enumerating MUSes is extremely…
Enumerating chemical graphs satisfying given constraints is a fundamental problem in mathematical and computational chemistry, and plays an essential part in a recently proposed framework for the inverse QSAR/QSPR. In this paper,…
A group valued function on a graph is called balanced if the product of its values along any cycle is equal to the identity element of the group. We compute the number of balanced functions from edges and vertices of a directed graph to a…
In this paper, we provide a novel enumeration algorithm for the set of all walks of a given length within a directed graph. Our algorithm has worst-case constant delay between outputting succinct representations of such walks, after a…
In a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. A graph is called cyclically orientable if it admits an orientation in which every chordless cycle is cyclically oriented. We propose an…
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is useful not only to find one solution but also to enumerate all the solutions with good values of objectives. However,…
We study ranked enumeration of join-query results according to very general orders defined by selective dioids. Our main contribution is a framework for ranked enumeration over a class of dynamic programming problems that generalizes…
A closed plane meander of order $n$ is a closed self-avoiding curve intersecting an infinite line $2n$ times. Meanders are considered distinct up to any smooth deformation leaving the line fixed. We have developed an improved algorithm,…
A number of recent works have used a variety of combinatorial constructions to derive Tanner graphs for LDPC codes and some of these have been shown to perform well in terms of their probability of error curves and error floors. Such graphs…
We introduce an algorithm based on a method of snapshots for computing approximate balanced truncations for discrete-time, stable, linear time-periodic systems. By construction, this algorithm is applicable to very high-dimensional systems,…
In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…
Classical graph algorithms work well for combinatorial problems that can be thoroughly formalized and abstracted. Once the algorithm is derived, it generalizes to instances of any size. However, developing an algorithm that handles complex…
The sparsest cut problem consists of identifying a small set of edges that breaks the graph into balanced sets of vertices. The normalized cut problem balances the total degree, instead of the size, of the resulting sets. Applications of…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…