LIPIcs - Leibniz International Proceedings in Informatics. 29th Annual European Symposium on Algorithms (ESA 2021)
Publication date
01/01/2021
Field of study
In this work, we present the first linear time deterministic algorithm computing the 4-edge-connected components of an undirected graph. First, we show an algorithm listing all 3-edge-cuts in a given 3-edge-connected graph, and then we use the output of this algorithm in order to determine the 4-edge-connected components of the graph
LIPIcs - Leibniz International Proceedings in Informatics. 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022)
Publication date
15/10/2021
Field of study
For every fixed d∈N, we design a data structure that
represents a binary n×n matrix that is d-twin-ordered. The data
structure occupies Od(n) bits, which is the least one could hope for, and
can be queried for entries of the matrix in time Od(loglogn) per query.Comment: 24 pages, 2 figure