204 research outputs found

### Fully-online Construction of Suffix Trees for Multiple Texts

We consider fully-online construction of indexing data structures for multiple texts. Let T = {T_1, ..., T_K} be a collection of texts. By fully-online, we mean that a new character can be appended to any text in T at any time. This is a natural generalization of semi-online construction of indexing data structures for multiple texts in which, after a new character is appended to the kth text T_k, then its previous texts T_1, ..., T_k-1 will remain static. Our fully-online scenario arises when we maintain dynamic indexes for multi-sensor data. Let N and sigma denote the total length of texts in T and the alphabet size, respectively. We first show that the algorithm by Blumer et al. [Theoretical Computer Science, 40:31-55, 1985] to construct the directed acyclic word graph (DAWG) for T can readily be extended to our fully-online setting, retaining O(N log sigma)-time and O(N)-space complexities. Then, we give a sophisticated fully-online algorithm which constructs the suffix tree for T in O(N log sigma) time and O(N) space. A key idea of this algorithm is synchronized maintenance of the DAWG and the suffix tree

### Efficient Enumeration of Dominating Sets for Sparse Graphs

A dominating set D of a graph G is a set of vertices such that any vertex in G is in D or its neighbor is in D. Enumeration of minimal dominating sets in a graph is one of central problems in enumeration study since enumeration of minimal dominating sets corresponds to enumeration of minimal hypergraph transversal. However, enumeration of dominating sets including non-minimal ones has not been received much attention. In this paper, we address enumeration problems for dominating sets from sparse graphs which are degenerate graphs and graphs with large girth, and we propose two algorithms for solving the problems. The first algorithm enumerates all the dominating sets for a k-degenerate graph in O(k) time per solution using O(n + m) space, where n and m are respectively the number of vertices and edges in an input graph. That is, the algorithm is optimal for graphs with constant degeneracy such as trees, planar graphs, H-minor free graphs with some fixed H. The second algorithm enumerates all the dominating sets in constant time per solution for input graphs with girth at least nine

### Efficient Enumeration Algorithm for Dominating Sets in Bounded Degenerate Graphs (Foundations and Applications of Algorithms and Computation)

Dominating sets are fundamental graph structures. However, enumeration of dominating sets has not received much attention. This study aims to propose an efficient enumeration algorithms for bounded degenerate graphs. The algorithm enumerates all the dominating sets for k-degenerate graphs in O(k) time per solution using O(n+m) space. Since planar graphs have a constant degeneracy, this algorithm can enumerate all such sets for planar graphs in constant time per solution

### Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph

In this paper, we present the first study of the computational complexity of
converting an automata-based text index structure, called the Compact Directed
Acyclic Word Graph (CDAWG), of size $e$ for a text $T$ of length $n$ into other
text indexing structures for the same text, suitable for highly repetitive
texts: the run-length BWT of size $r$, the irreducible PLCP array of size $r$,
and the quasi-irreducible LPF array of size $e$, as well as the lex-parse of
size $O(r)$ and the LZ77-parse of size $z$, where $r, z \le e$. As main
results, we showed that the above structures can be optimally computed from
either the CDAWG for $T$ stored in read-only memory or its self-index version
of size $e$ without a text in $O(e)$ worst-case time and words of working
space. To obtain the above results, we devised techniques for enumerating a
particular subset of suffixes in the lexicographic and text orders using the
forward and backward search on the CDAWG by extending the results by
Belazzougui et al. in 2015.Comment: The short version of this paper will appear in SPIRE 2023, Pisa,
Italy, September 26-28, 2023, Lecture Notes in Computer Science, Springe

### Ordered Counterfactual Explanation by Mixed-Integer Linear Optimization

Post-hoc explanation methods for machine learning models have been widely
used to support decision-making. One of the popular methods is Counterfactual
Explanation (CE), also known as Actionable Recourse, which provides a user with
a perturbation vector of features that alters the prediction result. Given a
perturbation vector, a user can interpret it as an "action" for obtaining one's
desired decision result. In practice, however, showing only a perturbation
vector is often insufficient for users to execute the action. The reason is
that if there is an asymmetric interaction among features, such as causality,
the total cost of the action is expected to depend on the order of changing
features. Therefore, practical CE methods are required to provide an
appropriate order of changing features in addition to a perturbation vector.
For this purpose, we propose a new framework called Ordered Counterfactual
Explanation (OrdCE). We introduce a new objective function that evaluates a
pair of an action and an order based on feature interaction. To extract an
optimal pair, we propose a mixed-integer linear optimization approach with our
objective function. Numerical experiments on real datasets demonstrated the
effectiveness of our OrdCE in comparison with unordered CE methods.Comment: 20 pages, 5 figures, to appear in the 35th AAAI Conference on
Artificial Intelligence (AAAI 2021

- …