Pages that link to "Item:Q5617572"
From MaRDI portal
The following pages link to Optimal Sequential Partitions of Graphs (Q5617572):
Displayed 19 items.
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- On the complexity of partitioning sparse matrix representations (Q786530) (← links)
- A hybrid clustering algorithm (Q883287) (← links)
- Approximations to clustering and subgraph problems on trees (Q1056227) (← links)
- Richard Bellman's contributions to computer science (Q1081590) (← links)
- A recursive Lagrangian method for clustering problems (Q1111289) (← links)
- A Lagrangian treatment of certain nonlinear clustering problems (Q1148791) (← links)
- An effective structured approach to finding optimal partitions of networks (Q1164549) (← links)
- Equipartitions of graphs (Q1182860) (← links)
- Optimal chain partitions of trees (Q1223159) (← links)
- Partitioning of sequentially ordered systems using linear programming (Q1362974) (← links)
- Consecutive interval query and dynamic programming on intervals (Q1392542) (← links)
- Parametric linear programming and cluster analysis (Q1806869) (← links)
- A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs (Q1806891) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- (Q3031908) (← links)
- The linearization of flow charts (Q4076757) (← links)
- Applications of graph theory in computer systems (Q4079059) (← links)
- Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs (Q5230645) (← links)