Compact representation for matrices of bounded twin-width

10/15/2021
by   Michał Pilipczuk, et al.
0

For every fixed d ∈ℕ, we design a data structure that represents a binary n × n matrix that is d-twin-ordered. The data structure occupies O_d(n) bits, which is the least one could hope for, and can be queried for entries of the matrix in time O_d(loglog n) per query.

READ FULL TEXT

page 3

page 5

page 7

page 9

page 11

page 15

page 17

page 21

research
07/01/2018

Representation of ordered trees with a given degree distribution

The degree distribution of an ordered tree T with n nodes is n⃗ = (n_0,....
research
07/10/2019

Efficient Gauss Elimination for Near-Quadratic Matrices with One Short Random Block per Row, with Applications

In this paper we identify a new class of sparse near-quadratic random Bo...
research
11/08/2017

Run Compressed Rank/Select for Large Alphabets

Given a string of length n that is composed of r runs of letters from th...
research
07/01/2023

Abstract Orientable Incidence Structure and Algorithms for Finite Bounded Acyclic Categories. II. Data Structure and Fundamental Operations

A data structure for finite bounded acyclic categories has been built, w...
research
02/05/2021

Twin-width IV: low complexity matrices

We establish a list of characterizations of bounded twin-width for hered...
research
09/06/2020

The Mixture Graph-A Data Structure for Compressing, Rendering, and Querying Segmentation Histograms

In this paper, we present a novel data structure, called the Mixture Gra...
research
09/24/2022

Twin-width V: linear minors, modular counting, and matrix multiplication

We continue developing the theory around the twin-width of totally order...

Please sign up or login with your details

Forgot password? Click here to reset