Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth

Authors:
Hans L. Bodlaender;Babette de Fluiter
Affiliations:
-;-
Venue:
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
Year:
1996

Citing 0
Cited 4

Listing all potential maximal cliques of a graph

Theoretical Computer Science
Listing All Potential Maximal Cliques of a Graph

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Confluence of graph transformation revisited

Processes, Terms and Cycles
Kernelization --- preprocessing with a guarantee

The Multivariate Algorithmic Revolution and Beyond

Quantified Score

Hi-index	0.01

Visualization

Abstract