Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

doi 10.1137/1.9781611975994.126
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Computing Queries on Linear Constraint Databases

1995English

Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts

2013English

Comparison and Improvement of Algorithms for Computing Minimal Cut Sets

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2013English

Computing Walrasian Equilibria: Fast Algorithms and Structural Properties

Mathematical Programming, Series B
MathematicsSoftware
2018English

Fast Normalized Cut With Linear Constraints

2009English

ADaM: Augmenting Existing Approximate Fast Matching Algorithms With Efficient and Exact Range Queries

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2014English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Computing Cubic Fields in Quasi-Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1996English

Level Planarity Testing in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy