Optimal Sequential Partitions of Graphs

DOI10.1145/321623.321627MaRDI QIDQ5617572zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(19)

• 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
• A polyhedral study of lifted multicuts
• scientific article; zbMATH DE number 4129970 (Why is no real title available?)
• A branch-and-bound algorithm for the acyclic partitioning problem
• The linearization of flow charts
• Applications of graph theory in computer systems
• Multilevel algorithms for acyclic partitioning of directed acyclic graphs
• On the complexity of partitioning sparse matrix representations
• A hybrid clustering algorithm

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5617572)