Further Results on Online Node- and Edge-Deletion Problems with Advice

DOI10.1007/978-3-030-48966-3_11OpenAlexW3031571787MaRDI QIDQ5041186

Ling-Ju Hung, Li-Hsuan Chen, Henri Lotze, Peter Rossmanith

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-48966-3_11

zbMATH Keywords

online algorithmnode deletionadvice complexitygraph modificationedge deletiondelayed decision model

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Online node- and edge-deletion problems with advice

Cites Work

• Unnamed Item
• Unnamed Item
• Online algorithms with advice: the tape model
• Online computation with advice
• Mathematics for the Analysis of Algorithms.
• On-line vertex-covering
• The online knapsack problem: advice and randomization
• Information Complexity of Online Problems
• On the Advice Complexity of Online Problems
• Advice Complexity of the Online Induced Subgraph Problem
• Measuring the problem-relevant information in input
• Node-and edge-deletion NP-complete problems
• On the Advice Complexity of Online Edge- and Node-Deletion Problems

This page was built for publication: Further Results on Online Node- and Edge-Deletion Problems with Advice