On strong (weak) independent sets and vertex coverings of a graph.
S. S. KamathR. S. BhatPublished in: Discret. Math. (2007)
Keyphrases
- directed graph
- undirected graph
- minimum weight
- labeled graphs
- hamiltonian cycle
- vertex set
- attributed graphs
- maximum cardinality
- graph theory
- graph structure
- spanning tree
- graph representation
- rough sets
- weighted graph
- bipartite graph
- graph theoretic
- data sets
- average degree
- information systems
- stable set
- high level
- pattern recognition
- random walk
- graph grammars
- graph clustering
- small world
- edge weights
- ranking algorithm
- directed acyclic graph