Embeddings of \(k\)-connected graphs of pathwidth \(k\)
type: Item
instance of: scholarly article
title: Embeddings of \(k\)-connected graphs of pathwidth \(k\)
zbMATH Open document ID: 1055.05143
author: N. Nishimura
author: Andrzej Proskurowski
author: Prabhakar Ragde
author: Arvind Kumar Gupta
published in: Discrete Applied Mathematics
publication date: 2005-02-22T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2136945
zbMATH Keywords: Subgraph isomorphism
zbMATH Keywords: Topological embedding
zbMATH Keywords: Pathwidth
MaRDI profile type: Publication
full work available at URL: j.dam.2002.12.005
OpenAlex ID: W2094337274
cites work: Efficient 2-dimensional approximate matching of half-rectangular figures
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Q5422499
cites work: Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
cites work: Q4393480
cites work: Sequential and parallel algorithms for embedding problems on classes of partial k-trees
cites work: The Parallel Complexity of Tree Embedding Problems
cites work: The complexity of subgraph isomorphism for classes of partial k-trees
cites work: Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees
cites work: Separating subgraphs in k-trees: Cables and caterpillars
cites work: Analysis of Algorithms for Listing Equivalence Classes of k-ary Strings
cites work: Mixed searching and proper-path-width
DOI: 10.1016/J.DAM.2002.12.005
description: scientific article; zbMATH DE number 2136945