A minimization version of a directed subgraph homeomorphism problem
type: Item
instance of: scholarly article
title: A minimization version of a directed subgraph homeomorphism problem
zbMATH Open document ID: 1161.90006
author: Janina A. Brenner
author: Sándor P. Fekete
author: Jan C. van der Veen
published in: Mathematical Methods of Operations Research
publication date: 2009-04-27T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 5547526
zbMATH Keywords: subgraph homeomorphism
zbMATH Keywords: topological minor
zbMATH Keywords: NP-completeness
zbMATH Keywords: approximation algorithms
zbMATH Keywords: reconfigurable computing
zbMATH Keywords: acyclic directed pattern graph
zbMATH Keywords: host graph
zbMATH Keywords: minimal height
zbMATH Keywords: data flow graph
MaRDI profile type: Publication
full work available at URL: s00186-008-0259-0
OpenAlex ID: W1987556067
cites work: An approach to the subgraph homeomorphism problem
cites work: The complexity of minimizing wire lengths in VLSI layouts
cites work: The directed subgraph homeomorphism problem
cites work: Q4198056
cites work: Combinatorial optimization. Theory and algorithms.
cites work: Large Topological Cliques in Graphs Without a 4-Cycle
cites work: The subgraph homeomorphism problem
cites work: Topological subgraphs in graphs of large girth
cites work: The complexity of satisfiability problems
DOI: 10.1007/S00186-008-0259-0
description: scientific article; zbMATH DE number 5547526