Bhattacharya, Sayan and Kulkarni, Janardhan (2020) An improved algorithm for incremental cycle detection and topological ordering in sparse graphs. In: 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Salt Lake City, Utah, U.S., 5-8 Jan 2020. Published in: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (In Press)

Preview

PDF WRAP-improved-algorithm-incremental-cycle-detection-topological-ordering-sparse-graphs-Bhattacharya-2020.pdf - Accepted Version - Requires a PDF viewer. Download (914Kb) | Preview

Request Changes to record.

Item Type:	Conference Item (Paper)
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Graph theory -- Data processing, Computer algorithms
Journal or Publication Title:	Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA)
Publisher:	Society for Industrial and Applied Mathematics
Official Date:	January 2020
Dates:	Date Event January 2020 Available 24 September 2019 Accepted
Date of first compliant deposit:	28 November 2019
Status:	Peer Reviewed
Publication Status:	In Press
Publisher Statement:	Published in Proceedings of ACM-SIAM Symposium on Discrete Algorithms, published by the Society for Industrial and Applied Mathematics (SIAM) Copyright © 2020 by SIAM. Unauthorized reproduction of this article is prohibited.
Access rights to Published version:	Restricted or Subscription Access
Conference Paper Type:	Paper
Title of Event:	31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
Type of Event:	Conference
Location of Event:	Salt Lake City, Utah, U.S.
Date(s) of Event:	5-8 Jan 2020
Related URLs:	Publisher

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads