Minimum degree orderings
type: Item
instance of: scholarly article
title: Minimum degree orderings
zbMATH Open document ID: 1187.68352
author: Hiroshi Nagamochi
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5674318
zbMATH Keywords: edge-connectivity
zbMATH Keywords: extreme subsets
zbMATH Keywords: graph algorithms
zbMATH Keywords: maximum adjacency orderings
zbMATH Keywords: minimum cuts
zbMATH Keywords: minimum degree orderings
zbMATH Keywords: submodular functions
zbMATH Keywords: posi-modular functions
MaRDI profile type: Publication
full work available at URL: s00453-008-9239-2
OpenAlex ID: W2170044697
cites work: A correctness certificate for the Stoer-Wagner min-cut algorithm
cites work: Augmenting Undirected Edge Connectivity in Õ(n2) Time
cites work: Q5501810
cites work: Multi-Terminal Network Flows
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Minimum cuts in near-linear time
cites work: A new approach to the minimum cut problem
cites work: Cutsets and partitions of hypergraphs
cites work: k-Components, Clusters and Slicings in Graphs
cites work: Smallest-last ordering and clustering and graph coloring algorithms
cites work: GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: A note on minimizing submodular functions
cites work: Minimum cost subpartitions in graphs
cites work: A Fast Algorithm for Optimally Increasing the Edge Connectivity
cites work: Minimizing symmetric submodular functions
cites work: Minimum Cost Source Location Problems with Flow Requirements
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: A simple min-cut algorithm
cites work: Edge-connectivity augmentation problems
DOI: 10.1007/S00453-008-9239-2
description: scientific article; zbMATH DE number 5674318