Optimal Sequential Partitions of Graphs
From MaRDI portal
Publication:5617572
DOI10.1145/321623.321627zbMath0214.51703MaRDI QIDQ5617572
Publication date: 1971
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321623.321627
05C20: Directed graphs (digraphs), tournaments
Related Items
On the complexity of partitioning sparse matrix representations, A hybrid clustering algorithm, Approximations to clustering and subgraph problems on trees, Richard Bellman's contributions to computer science, A recursive Lagrangian method for clustering problems, A Lagrangian treatment of certain nonlinear clustering problems, An effective structured approach to finding optimal partitions of networks, Equipartitions of graphs, Optimal chain partitions of trees, Partitioning of sequentially ordered systems using linear programming, Consecutive interval query and dynamic programming on intervals, Parametric linear programming and cluster analysis, A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs, Unnamed Item, The linearization of flow charts, Applications of graph theory in computer systems