A linear algorithm to decompose inheritance graphs into modules
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4098742 (Why is no real title available?)
- scientific article; zbMATH DE number 3481857 (Why is no real title available?)
- scientific article; zbMATH DE number 3641455 (Why is no real title available?)
- A linear algorithm to decompose inheritance graphs into modules
- Area requirement and symmetry display of planar upward drawings
- Depth-First Search and Linear Graph Algorithms
- Incremental modular decomposition
- On the X-join decomposition for undirected graphs
- The Recognition of Series Parallel Digraphs
- The Transitive Reduction of a Directed Graph
- The number of depth-first searches of an ordered set
- \(P_ 4\)-trees and substitution decomposition
Cited in
(5)- Graph decompositions definable in monadic second-order logic
- scientific article; zbMATH DE number 2114137 (Why is no real title available?)
- Partition refinement techniques: an interesting algorithmic tool kit
- A survey of the algorithmic aspects of modular decomposition
- A linear algorithm to decompose inheritance graphs into modules
This page was built for publication: A linear algorithm to decompose inheritance graphs into modules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1892582)