Work

Maintaining an EDCS in General Graphs: Simpler, Density-Sensitive and with Worst-Case Time Bounds

Year: 2025

Type: article

Source: ACM Transactions on Algorithms

DOI: 10.1145/3765900

Authors: Fabrizio Grandoni, Chris Schwiegelshohn, Shay Solomon, Amitai Uzrad

Institutions: University of Applied Sciences and Arts of Southern Switzerland, Dalle Molle Institute for Artificial Intelligence Research, Università della Svizzera italiana, Aarhus University, Tel Aviv University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung, United States-Israel Binational Science Foundation

Awards: G485746220, G7545535223

OpenAlex ID: W4414392145

FWCI:

Cites: 9

Cited by:

Related to: