Efficient Computation of Dominance in Component Systems (Short Paper)

DOI10.1007/978-3-642-24690-6_27MaRDI QIDQ3095251zbMATH OpenOpenAlexFDO

Authors Jaap P. Boender

Publication date 28 October 2011

Published in Software Engineering and Formal Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24690-6_27

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1689581
• The computational complexity of dominance and consistency in CP-nets
• Computing dominators in parallel
• Note on complexity of computing the domination of binary systems
• Domination of discrete distributed systems
• An efficient algorithm for the configuration problem of dominance graphs
• Computing multiperiod efficiency using dominance networks
• An efficient graph algorithm for dominance constraints
• Weak and exact domination in distributed systems
• scientific article; zbMATH DE number 5010630

Cites work

• A fast algorithm for finding dominators in a flowgraph

Cited in

(1)

• Augmenting measure sensitivity to detect essential, dispensable and highly incompatible features in mass customization

This page was built for publication: Efficient Computation of Dominance in Component Systems (Short Paper)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095251)