Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract).
Mihalis YannakakisParis C. KanellakisStavros S. CosmadakisChristos H. PapadimitriouPublished in: ICALP (1983)
Keyphrases
- extended abstract
- graph partitioning
- partitioning algorithm
- pattern matching
- graph model
- graph theory
- spectral graph
- graph patterns
- graph representation
- directed graph
- graph theoretic
- spanning tree
- normalized cut
- fixed number
- bipartite graph
- random walk
- graph mining
- graph structure
- stable set
- vertex set
- minimum cut
- structural patterns
- clustering algorithm
- genetic algorithm
- bounded treewidth
- dependency graph
- maximum flow
- adjacency matrix
- graph structures
- graph search
- data structure
- semi supervised
- structured data
- connected components
- graph matching
- neural network
- graph databases
- pattern discovery