Metody rozdělení grafu a jejich aplikace na řešení vybraných inženýrských úloh

Abstract

In the present work we study graph partitioning methods. We describe easy methods based on graph algorithms as well methods based on deep knowledge of graph theory and linear algebra. These methods are fast and effective.

Description

Import 04/07/2011

Subject(s)

graph partitioning, pseudo-peripheral node, breadth-first search, depth-first search, Lanczos method

Citation