On the complexity of the subgraph problem 论文

1985Czech digital mathematics library引用 230
PDF
Graph Theory and AlgorithmsAdvanced Graph Theory ResearchOptimization and Packing Problems
Advanced Graph Theory ResearchGraph Theory and AlgorithmsOptimization and Packing Problems
相关技术:Graph Theory and AlgorithmsOptimization and Packing Problems
关系图谱

2

作者

2

相关技术

0

相关事件

0

相关文章

摘要

Aba tract: The complexity of the problem "Does a giTengraph contain a complete subgraph with k Tertices?" is 0(n ).

作者查看全部 (2)

S

Svatopluk Poljak

雅

雅羅斯拉夫·內舍特日爾

相关技术查看全部 (2)

Graph Theory and AlgorithmsOptimization and Packing Problems

相关事件

暂无数据

相关文章

暂无数据