Algorithms for generalized vertex-rankings of partial k-trees (Q1575443): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Md. Abul Kashem / rank
Normal rank
 
Property / author
 
Property / author: Xiao Zhou / rank
Normal rank
 
Property / author
 
Property / author: Takao Nishizeki / rank
Normal rank
 
Property / author
 
Property / author: Md. Abul Kashem / rank
 
Normal rank
Property / author
 
Property / author: Xiao Zhou / rank
 
Normal rank
Property / author
 
Property / author: Takao Nishizeki / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rankings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal edge ranking of trees in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multifrontal Solution of Indefinite Sparse Symmetric Linear / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an edge ranking problem of trees and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for generalized vertex-rankings of partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge ranking of graphs is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Role of Elimination Trees in Sparse Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal node ranking of tree in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385515 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:12, 30 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for generalized vertex-rankings of partial k-trees
scientific article

    Statements

    Algorithms for generalized vertex-rankings of partial k-trees (English)
    0 references
    21 August 2000
    0 references
    0 references
    algorithm
    0 references
    partial-tree
    0 references
    separator tree
    0 references
    treewidth
    0 references
    vertex-ranking
    0 references
    0 references
    0 references
    0 references