The Separator Theorem for Rooted Directed Vertex Graphs.
B. S. PandaPublished in: J. Comb. Theory, Ser. B (2001)
Keyphrases
- directed graph
- undirected graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- vertex set
- maximum cardinality
- connected subgraphs
- graph matching
- structured objects
- graph theory
- neural network
- subgraph isomorphism
- graph partitioning
- adjacency matrix
- series parallel
- strongly connected
- graph clustering
- edge weights
- bipartite graph
- random walk
- data mining
- real time