Canonical representations of partial 2- and 3-trees

Authors:
Stefan Arnborg;Andrzej Proskurowski
Affiliations:
-;-
Venue:
BIT
Year:
1992

Citing 0
Cited 2

Efficient frequent connected subgraph mining in graphs of bounded tree-width

Theoretical Computer Science
A logspace algorithm for partial 2-tree canonization

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract