Polynomial time algorithms for variants of graph matching on partial \(k\)-trees
type: Item
instance of: scholarly article
title: Polynomial time algorithms for variants of graph matching on partial \(k\)-trees
zbMATH Open document ID: 1378.05200
author: Takayuki Nagoya
published in: Foundations of Computing and Decision Sciences
publication date: 2018-01-26T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6829862
zbMATH Keywords: graph isomorphism with restriction
zbMATH Keywords: partial \(k\)-trees
zbMATH Keywords: polynomial time algorithm
MaRDI profile type: Publication
full work available at URL: fcds-2016-0010
OpenAlex ID: W2526117656
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: Graph Classes: A Survey
cites work: On testing isomorphism of permutation graphs
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Q4273947
cites work: Some NP-Complete Problems Similar to Graph Isomorphism
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Subtree Isomorphism in O(n5/2)
cites work: Computational complexity of computing a partial solution for the graph automorphism problems
cites work: Laminar structure of ptolemaic graphs with applications
DOI: 10.1515/FCDS-2016-0010
Recommended article: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
Recommended article: Q3796771
Recommended article: Q4263472
Recommended article: Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
Recommended article: Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
Recommended article: The complexity of subgraph isomorphism for classes of partial k-trees
Recommended article: Q3646847
Recommended article: Q3766846
Recommended article: Q3692864
Recommended article: Practical algorithms on partial k-trees with an application to domination-like problems
description: scientific article; zbMATH DE number 6829862