Pages that link to "Item:Q1775059"
From MaRDI portal
The following pages link to Balanced vertex-orderings of graphs (Q1775059):
Displaying 25 items.
- Brushing with additional cleaning restrictions (Q300254) (← links)
- Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree (Q543514) (← links)
- Fast edge searching and fast searching on graphs (Q631784) (← links)
- Cleaning with brooms (Q659685) (← links)
- Cleaning random \(d\)-regular graphs with brooms (Q659724) (← links)
- The minimum feasible tileset problem (Q666670) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Clean the graph before you draw it! (Q987793) (← links)
- Bounded degree acyclic decompositions of digraphs. (Q1426101) (← links)
- Balanced vertex-orderings of graphs (Q1775059) (← links)
- Optimal three-dimensional orthogonal graph drawing in the general position model. (Q1874390) (← links)
- \textsc{polish} -- Let us play the cleaning game (Q1929225) (← links)
- The referenced vertex ordering problem: theory, applications, and solution methods (Q2165588) (← links)
- On the brush number of the Cartesian product of tree with path or cycle (Q2399728) (← links)
- Imbalance is fixed parameter tractable (Q2445234) (← links)
- Three-fast-searchable graphs (Q2446838) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- On the Most Imbalanced Orientation of a Graph (Q3196369) (← links)
- Algorithmic Applications of Tree-Cut Width (Q5048301) (← links)
- Density decompositions of networks (Q5233139) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Imbalance parameterized by twin cover revisited (Q5925526) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- Degree-constrained orientations of embedded graphs (Q5963649) (← links)
- Good acyclic orientations of 4‐regular 4‐connected graphs (Q6081883) (← links)
