Partitioning planar graphs with vertex costs: Algorithms and applications
type: Item
instance of: scholarly article
title: Partitioning planar graphs with vertex costs: Algorithms and applications
zbMATH Open document ID: 0959.68098
published in: Algorithmica
publication date: 2000-08-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1496833
zbMATH Keywords: graph embedding problems
zbMATH Keywords: graph pebbling
zbMATH Keywords: multicommodity flow problems
author: Hristo N. Djidjev
MaRDI profile type: Publication
full work available at URL: s004530010031
OpenAlex ID: W2017376066
DOI: 10.1007/S004530010031
description: scientific article; zbMATH DE number 1496833