A database of structural graph parameters, their properties, and relationships in parameterized complexity theory.
HOPS provides a comprehensive reference for researchers working with graph parameters. The database includes:
- Parameter definitions (treewidth, pathwidth, clique-width, etc.)
- Bounding relationships between parameters
- References to relevant publications
- Visual diagrams showing parameter hierarchies
parameters/
├── code/ # Rust database and content generator
├── handcrafted/ # Manual website content and bibliography (main.bib)
├── web/ # Generated Hugo website (git submodule)
├── docs/ # Project documentation
└── scripts/ # Utility scripts
cd code
cargo run allcd web
hugo serverContributions are welcome! You can help by:
- Adding parameters - Edit
code/src/collection.rsusing the builder API - Adding relations - Document bounds between parameters with source references
- Improving content - Enhance descriptions or add missing information
- Reporting issues - Submit bug reports or feature requests
- Contributing Guide - How to add parameters and relations
- Codebase Overview - Technical architecture and module structure
- GitHub Issues - Bug reports, feature requests
- Feedback Form - Anonymous feedback
This project builds upon earlier work in the field:
- Parameterized Hierarchy (2013-2019) by Manuel Sorge
- Comparing Graph Parameters by J. Ch. B. Schröder
- Comparing 17 Graph Parameters (2010) by Róbert Sasák
MIT License - Copyright (c) 2023-2026 Václav Blažej & contributors