Certifying induced subgraphs in large graphs

DOI10.1007/978-3-031-27051-2_20arXiv2210.13057MaRDI QIDQ6091166

No author found.

Publication date: 24 November 2023

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.13057

zbMATH Keywords

graph algorithmexternal memorycertifying algorithm

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Certifying algorithms
• The buffer tree: A technique for designing batched external data structures
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Design and Engineering of External Memory Traversal Algorithms for General Graphs
• Node-Deletion Problems on Bipartite Graphs
• Sequential and Parallel Algorithms and Data Structures

This page was built for publication: Certifying induced subgraphs in large graphs