Decomposition Trees: Structured Graph Representation and Efficient Algorithms

Decomposition Trees: Structured Graph Representation and Efficient Algorithms
复制标题

分解树:结构化图表示和高效算法

DOI:
--
复制
发表时间:
1988
期刊:
Colloquium on Trees in Algebra and Programming
影响因子:
--
通讯作者:
C. Lautemann
C. Lautemann
中科院分区:
--
文献类型:
--
作者:
C. Lautemann

文献摘要

被引文献

相似文献

一种数据结构,分解树,介绍,它使图表示在一定的结构化的方式,并导致简单,递归算法的许多困难的图形问题。
A data structure, decomposition trees, is introduced, which enables graphs to be represented in a certain structured way, and which leads to simple, recursive algorithms for many difficult graph problems.