Partitioning graphs of supply and demand
type: Item
instance of: scholarly article
title: Partitioning graphs of supply and demand
zbMATH Open document ID: 1211.05129
author: Takehiro Ito
author: Xiao Zhou
author: Takao Nishizeki
published in: Discrete Applied Mathematics
publication date: 2010-04-28T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5702580
zbMATH Keywords: demand vertex
zbMATH Keywords: graph partition problem
zbMATH Keywords: series-parallel graph
zbMATH Keywords: supply vertex
zbMATH Keywords: partial \(k\)-tree
MaRDI profile type: Publication
full work available at URL: j.dam.2008.08.012
OpenAlex ID: W2048212722
cites work: Easy problems for tree-decomposable graphs
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
cites work: Monadic second-order evaluations on tree-decomposable graphs
cites work: Q4198056
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: PARTITIONING TREES OF SUPPLY AND DEMAND
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees
DOI: 10.1016/J.DAM.2008.08.012
description: scientific article; zbMATH DE number 5702580