Algorithms for generalized vertex-rankings of partial k-trees
From MaRDI portal
Publication:1575443
DOI10.1016/S0304-3975(99)00240-6zbMath0945.68142MaRDI QIDQ1575443
Md. Abul Kashem, Xiao Zhou, Takao Nishizeki
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (8)
An optimal parallel algorithm forc-vertex-ranking of trees ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ Edge ranking of graphs is hard ⋮ Finding the edge ranking number through vertex partitions ⋮ How to compute digraph width measures on directed co-graphs ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Comparing linear width parameters for directed graphs ⋮ Algorithms for generalized vertex-rankings of partial k-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On an edge ranking problem of trees and graphs
- Optimal node ranking of trees
- Edge ranking of graphs is hard
- Algorithms for generalized vertex-rankings of partial k-trees
- Optimal node ranking of tree in linear time
- Optimal edge ranking of trees in polynomial time
- Ordered colourings
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
- The Role of Elimination Trees in Sparse Factorization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Graph minors. II. Algorithmic aspects of tree-width
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- Rankings of Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: Algorithms for generalized vertex-rankings of partial k-trees
