Optimal Sequential Partitions of Graphs

DOI10.1145/321623.321627zbMath0214.51703OpenAlexW2002292054MaRDI QIDQ5617572

Brian Kernighan

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (19)

Richard Bellman's contributions to computer science ⋮ A branch-and-bound algorithm for the acyclic partitioning problem ⋮ Partitioning of sequentially ordered systems using linear programming ⋮ A recursive Lagrangian method for clustering problems ⋮ Unnamed Item ⋮ A hybrid clustering algorithm ⋮ Consecutive interval query and dynamic programming on intervals ⋮ A Lagrangian treatment of certain nonlinear clustering problems ⋮ A polyhedral study of lifted multicuts ⋮ An effective structured approach to finding optimal partitions of networks ⋮ The linearization of flow charts ⋮ Applications of graph theory in computer systems ⋮ Equipartitions of graphs ⋮ Optimal chain partitions of trees ⋮ Parametric linear programming and cluster analysis ⋮ A simulated annealing algorithm with the random compound move for the sequential partitioning problem of directed acyclic graphs ⋮ Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs ⋮ On the complexity of partitioning sparse matrix representations ⋮ Approximations to clustering and subgraph problems on trees

This page was built for publication: Optimal Sequential Partitions of Graphs