相关论文: Structure and Complexity of Bag Consistency

Transactions simplify concurrent programming by enabling computations on shared data that are isolated from other concurrent computations and are resilient to failures. Modern databases provide different consistency models for transactions…

The principle of similarity, or homophily, is often used to explain patterns observed in complex networks such as transitivity and the abundance of triangles (3-cycles). However, many phenomena from division of labor to protein-protein…

Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…

The need to build a link between the structure of a complex network and the dynamical properties of the corresponding complex system (comprised of multiple low dimensional systems) has recently become apparent. Several attempts to tackle…

Ordered matchings, defined as graphs with linearly ordered vertices, where each vertex is connected to exactly one edge, play a crucial role in the area of ordered graphs and their homomorphisms. Therefore, we consider related problems from…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…

Estimating the structure of directed acyclic graphs (DAGs) of features (variables) plays a vital role in revealing the latent data generation process and providing causal insights in various applications. Although there have been many…

Hypergraph is the most general model for complex networks involving group interactions. Taking the ideas of path homology from Alexander Grigor'yan, Yong Lin, Yuri Muranov and Shing-Tung Yau [18-22], Stephane Bressan, Jingyan Li and the…

Symmetry in biological and physical systems is a product of self organization driven by evolutionary processes, or mechanical systems under constraints. Symmetry based feature extrac-tion or representation by neural networks may unravel the…

This paper investigates the role persistent arcs play for a social network to reach a global belief agreement under discrete-time or continuous-time evolution. Each (directed) arc in the underlying communication graph is assumed to be…

The notion of graph acyclicity has been extended to several different notions of hypergraph acyclicity, in increasing order of generality: gamma acyclicity, beta acyclicity, and alpha acyclicity, that have met a great interest in many…

The consistency problem for a class of algebraic structures asks for an algorithm to decide for any given conjunction of equations whether it admits a non-trivial satisfying assignment within some member of the class. By Adyan (1955) and…

Recently, Brand, Ganian and Simonov introduced a parameterized refinement of the classical PAC-learning sample complexity framework. A crucial outcome of their investigation is that for a very wide range of learning problems, there is a…

We study the existence of stable matchings when agents have choice correspondences instead of preference relations. We extend the framework of \cite{chambers2017choice} by weakening the path independence assumption. For many-to-many…

Stochastic dynamic matching problems have recently gained attention in the stochastic-modeling community due to their diverse applications, such as supply-chain management and kidney exchange programs. In this paper, we study a matching…

Exact sequences are a well known notion in homological algebra. We investigate here the more vague properties of 'homotopical exactness', appearing for instance in the fibre or cofibre sequence of a map. Such notions of exactness can be…

Persistence diagrams, combining geometry and topology for an effective shape description used in pattern recognition, have already proven to be an effective tool for shape representation with respect to a certainfiltering function.…

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

Time-evolving or temporal graphs gain more and more popularity when studying the behavior of complex networks. In this context, the multistage view on computational problems is among the most natural frameworks. Roughly speaking, herein one…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…