The complexity of learning minor closed graph classes
From MaRDI portal
Recommendations
- Quickly deciding minor-closed parameters in general graphs
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- On the purity of minor-closed classes of graphs
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes
- k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
- On random graphs from a minor-closed class
- Asymptotic properties of some minor-closed classes of graphs
- Asymptotic Properties of Some Minor-Closed Classes of Graphs
- The complexity of recognizing minimally tough graphs
- On the computational complexity of graph closures
Cites work
- A framework for polynomial-time query learnability
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. V. Excluding a planar graph
- scientific article; zbMATH DE number 67616 (Why is no real title available?)
- scientific article; zbMATH DE number 177810 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 2077162 (Why is no real title available?)
- Prediction-preserving reducibility
- Queries and concept learning
This page was built for publication: The complexity of learning minor closed graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083915)
