Algorithms for generalized vertex-rankings of partial k-trees
type: Item
instance of: scholarly article
title: Algorithms for generalized vertex-rankings of partial k-trees
zbMATH Open document ID: 0945.68142
DOI: 10.1016/S0304-3975(99)00240-6
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1493308
zbMATH Keywords: algorithm
zbMATH Keywords: partial-tree
zbMATH Keywords: separator tree
zbMATH Keywords: treewidth
zbMATH Keywords: vertex-ranking
author: Md. Abul Kashem
author: Xiao Zhou
author: Takao Nishizeki
MaRDI profile type: Publication
cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Rankings of Graphs
cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
cites work: Optimal edge ranking of trees in polynomial time
cites work: Q4942652
cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear
cites work: Optimal node ranking of trees
cites work: On an edge ranking problem of trees and graphs
cites work: Q4023519
cites work: Q4364591
cites work: Ordered colourings
cites work: Edge ranking of graphs is hard
cites work: Q4250211
cites work: The Role of Elimination Trees in Sparse Factorization
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Optimal node ranking of tree in linear time
cites work: Q4385515
cites work: Vertex ranking of asteroidal triple-free graphs
Recommended article: Q4364591
Recommended article: Algorithms for Vertex Partitioning Problems on Partial k-Trees
Recommended article: Q3821601
Recommended article: Algorithms and Computation
Recommended article: An optimal parallel algorithm forc-vertex-ranking of trees
Recommended article: Practical algorithms on partial k-trees with an application to domination-like problems
Recommended article: Q3758843
Recommended article: Vertex partitioning problems on partial k-trees
Recommended article: Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
description: scientific article; zbMATH DE number 1493308