Partition the vertices of a graph into one independent set and one acyclic set.

Aifeng Yang Jinjiang Yuan

Published in: Discret. Math. (2006)

Keyphrases

independent set
hamiltonian cycle
weighted graph
vertex set
maximum independent set
stable set
undirected graph
attributed graphs
random walk
maximum matching
graph structure
bipartite graph
directed graph
connected components
bayesian networks
partitioning algorithm
adjacency matrix
random graphs
disjoint subsets