The complexity of learning minor closed graph classes
From MaRDI portal
Publication:6083915
DOI10.1007/3-540-60454-5_43zbMath1527.68103OpenAlexW1500113010MaRDI QIDQ6083915
Carlos Domingo, John Shawe-Taylor
Publication date: 8 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60454-5_43
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Prediction-preserving reducibility
- Graph minors. III. Planar tree-width
- Graph minors. I. Excluding a forest
- Graph minors. V. Excluding a planar graph
- Queries and concept learning
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. II. Algorithmic aspects of tree-width
- A framework for polynomial-time query learnability
This page was built for publication: The complexity of learning minor closed graph classes
