On the complexity of the balanced vertex ordering problem
From MaRDI portal
Recommendations
Cited in
(18)- On the complexity of finding balanced oneway cuts
- Balanced vertex-orderings of graphs
- \textsc{polish} -- Let us play the cleaning game
- The distance orientation problem
- Imbalance, cutwidth, and the structure of optimal orderings
- Imbalance is fixed parameter tractable
- Brushing with additional cleaning restrictions
- On the complexity of planar covering of small graphs
- Imbalance is fixed parameter tractable
- Fast-mixed searching and related problems on graphs
- NP-COMPLETENESS AND APPROXIMATION ALGORITHM FOR THE MAXIMUM INTEGRAL VERTEX-BALANCED FLOW PROBLEM
- Optimally balanced forward degree sequence
- On the complexity of the balanced vertex ordering problem
- Imbalance parameterized by twin cover revisited
- Fast edge searching and fast searching on graphs
- Cleaning with brooms
- New algorithm for combinatorial n-folds and applications
- Clean the graph before you draw it!
This page was built for publication: On the complexity of the balanced vertex ordering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387696)