English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

Forster, S., Nanongkai, D., Yang, L., Saranurak, T., & Yingchareonthawornchai, S. (2020). Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms. In S. Chawla (Ed.), Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms (pp. 2046-2065). Philadelphia, PA: SIAM. doi:10.5555/3381089.3381215.

Item is

Basic

hide
Genre: Conference Paper

Files

show Files

Locators

show

Creators

hide
 Creators:
Forster, Sebastian1, Author           
Nanongkai, Danupon2, Author                 
Yang, Liu2, Author
Saranurak, Thatchaphol2, Author
Yingchareonthawornchai, Sorrachai2, Author
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2External Organizations, ou_persistent22              

Content

show

Details

hide
Language(s): eng - English
 Dates: 2020
 Publication Status: Published online
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Forster_SODA20
DOI: 10.5555/3381089.3381215
 Degree: -

Event

hide
Title: 31st Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Salt Lake City, UT, USA
Start-/End Date: 2020-01-05 - 2020-01-08

Legal Case

show

Project information

show

Source 1

hide
Title: Proceedings of the Thirty-First ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2020
Source Genre: Proceedings
 Creator(s):
Chawla, Shuchi1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 2046 - 2065 Identifier: ISBN: 978-1-61197-599-4