A faster algorithm for computing the principal sequence of partitions of a graph
From MaRDI portal
Publication:848839
DOI10.1007/s00453-008-9177-zzbMath1187.05071OpenAlexW1980424220MaRDI QIDQ848839
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9177-z
network strengthminimum cut/maximum flowparametric algorithmnetwork attackprincipal sequence of partitions
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- The principal lattice of partitions of a submodular function
- Submodular functions and optimization
- Separating from the dominant of the spanning tree polytope
- A faster algorithm for computing the strength of a network
- Submodular functions and electrical networks
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
- A data structure for dynamic trees
- Separation of Partition Inequalities
- NETWORK-FLOW ALGORITHMS FOR LOWER-TRUNCATED TRANSVERSAL POLYMATROIDS
- Optimal attack and reinforcement of a network
- Self-adjusting binary search trees
- A new approach to the maximum-flow problem
- A Separator Theorem for Planar Graphs
- Computing the Strength of a Graph
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Algorithms for Graphic Polymatroids and Parametrics-Sets
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- A Fast Parametric Maximum Flow Algorithm and Applications
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Unnamed Item
- Unnamed Item
This page was built for publication: A faster algorithm for computing the principal sequence of partitions of a graph
