Zobrazeno 1 - 10
of 53 996
pro vyhledávání: '"Data structures and algorithms"'
With the rise of social media, misinformation has significant negative effects on the decision-making of individuals, organizations and communities within society. Identifying and mitigating the spread of fake information is a challenging issue. We c
Externí odkaz:
http://arxiv.org/abs/2412.15671
Identifying and mitigating the spread of fake information is a challenging issue that has become dominant with the rise of social media. We consider a generalization of the Domination problem that can be used to detect a set of individuals who, once
Externí odkaz:
http://arxiv.org/abs/2412.15663
We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning tree of the g
Externí odkaz:
http://arxiv.org/abs/2412.14583
The famous Ryser--Brualdi--Stein conjecture asserts that every $n \times n$ Latin square contains a partial transversal of size $n-1$. Since its appearance, the conjecture has attracted significant interest, leading to several generalizations. One of
Externí odkaz:
http://arxiv.org/abs/2412.15457
Autor:
Hyun, Jake
Clustering is a key task in machine learning, with $k$-means being widely used for its simplicity and effectiveness. While 1D clustering is common, existing methods often fail to exploit the structure of 1D data, leading to inefficiencies. This thesi
Externí odkaz:
http://arxiv.org/abs/2412.15295
In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $\delta$ symbols by either finding a vocabulary directly (direct tokenisation), or selecting a sequence of merge op
Externí odkaz:
http://arxiv.org/abs/2412.15210
Autor:
Demaine, Erik D., Demaine, Martin L., Hecher, Markus, Lin, Rebecca, Luo, Victor H., Nara, Chie
We prove two results about transforming any convex polyhedron, modeled as a linkage L of its edges. First, if we subdivide each edge of L in half, then L can be continuously flattened into a plane. Second, if L is equilateral and we again subdivide e
Externí odkaz:
http://arxiv.org/abs/2412.15130
Autor:
Liu, Gangli
The all pairs shortest path problem is a fundamental optimization problem in graph theory. We deal with re-calculating the all-pairs shortest path (APSP) matrix after a minor modification of a weighted dense graph, e.g., adding a node, removing a nod
Externí odkaz:
http://arxiv.org/abs/2412.15122
Dynamically maintaining the minimum cut in a graph $G$ under edge insertions and deletions is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an $n$-node graph the best known
Externí odkaz:
http://arxiv.org/abs/2412.15069
Many natural computational problems, including e.g. Max Weight Independent Set, Feedback Vertex Set, or Vertex Planarization, can be unified under an umbrella of finding the largest sparse induced subgraph, that satisfies some property definable in C
Externí odkaz:
http://arxiv.org/abs/2412.14836