No label defined (Q3758844)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4008410
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4008410

      Statements

      0 references
      0 references
      1985
      0 references
      partial k-trees
      0 references
      [For the entire collection see Zbl 0619.00006.] Our interest in the class of k-trees and their subgraphs is motivated by practical applications in areas such as network reliability, concurrent broadcasting, and complexity of queries in a data base system. Because of their bounded decomposability, partial k-trees are efficiently tractable by dynamic programming type of algorithms. Here, we present some partial results leading to recognition of these graphs through application of a set of confluent reductions (rewriting rules) in a manner more efficient than a general brute force recognition method.
      0 references

      Identifiers