Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs

Authors:
Ton Kloks;Hans L. Bodlaender
Affiliations:
-;-
Venue:
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Year:
1992

Citing 0
Cited 4

An exact almost optimal algorithm for target set selection in social networks

Proceedings of the 10th ACM conference on Electronic commerce
Satisfiability of acyclic and almost acyclic CNF formulas (II)

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Treewidth governs the complexity of target set selection

Discrete Optimization
Satisfiability of acyclic and almost acyclic CNF formulas

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract