Improved Deterministic Algorithms for Decremental Transitive Closure and Strongly Connected Components

doi 10.1137/1.9781611973082.111
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

The Locally Transitive Representation of a Strongly Connected Tournament

Transactions of the Society of Instrument and Control Engineers
1990English

Computing Strongly Connected Components in Parallel on CUDA

2011English

Transitive-Closure Spanners

2009English

Improved Resampling Algorithms Based on Deterministic and Partial Resampling

DEStech Transactions on Computer Science and Engineering
2017English

A Transitive Closure Algorithm

BIT Numerical Mathematics
Computer NetworksApplied MathematicsSoftwareComputational MathematicsCommunications
1970English

Graph Encoding and Transitive Closure Representation

English

Deterministic Algorithms for Submodular Maximization Problems

2015English

Lower Bounds for Local Monotonicity Reconstruction From Transitive-Closure Spanners

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Deterministic Algorithms for the Lovász Local Lemma

SIAM Journal on Computing
MathematicsComputer Science
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy