AI Chat AI Image Generator AI Video Text to Speech

Linear-Time In-Place DFS and BFS in the Restore Model

03/12/2018

∙

by Frank Kammer, et al.

∙

∙

We present an in-place depth first search (DFS) and an in-place breadth first search (BFS) that runs in the restore model in linear time. To obtain our results we show several linear-time in-place graph transformations from one representation to another representation.

Frank Kammer
10 publications
Andrej Sajenko
8 publications

page 1

page 2

page 3

page 4

research

∙ 07/22/2019

Optimal In-place Algorithms for Basic Graph Problems

We present linear time in-place algorithms for several basic and fundam...

0 Sankardeep Chakraborty, et al. ∙

research

∙ 05/07/2020

Linear Time LexDFS on Chordal Graphs

Lexicographic Depth First Search (LexDFS) is a special variant of a Dept...

0 Jesse Beisegel, et al. ∙

research

∙ 04/24/2023

Median of heaps: linear-time selection by recursively constructing binary heaps

The first worst-case linear-time algorithm for selection was discovered ...

0 Oliver Serang, et al. ∙

research

∙ 06/14/2023

A note on the complexity of addition

We show that the sum of a sequence of integers can be computed in linear...

0 Emil Jeřábek, et al. ∙

research

∙ 09/13/2021

The inverse of Ackermann function is computable in linear time

We propose a detailed proof of the fact that the inverse of Ackermann fu...

0 Claude Sureson, et al. ∙

research

∙ 01/13/2022

PageRank Algorithm using Eigenvector Centrality – New Approach

The purpose of the research is to find a centrality measure that can be ...

0 Suvarna Saumya Chandrashekhar, et al. ∙

research

∙ 06/10/2021

Deterministic Mincut in Almost-Linear Time

We present a deterministic (global) mincut algorithm for weighted, undir...

0 Jason Li, et al. ∙