P4-trees and substitution decomposition

P4-trees and substitution decomposition

0.00 Avg rating0 Votes
Article ID: iaor19931430
Country: Netherlands
Volume: 39
Issue: 3
Start Page Number: 263
End Page Number: 291
Publication Date: Nov 1992
Journal: Discrete Applied Mathematics
Authors:
Abstract:

This paper introduces a new data structure called a P4-tree, and uses the data structure as part of an algorithm to find the substitution decomposition of a graph in O(mα(m,n)) time.

Reviews

Required fields are marked *. Your email address will not be published.