Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.
Daniël PaulusmaChristophe PicouleauBernard RiesPublished in: TAMC (2017)
Keyphrases
- undirected graph
- vertex set
- weighted graph
- edge weights
- directed graph
- labeled graphs
- attributed graphs
- minimum weight
- strongly connected
- minimum cost
- random graphs
- edge information
- graph structure
- spanning tree
- approximation algorithms
- directed acyclic graph
- graph theoretic
- bipartite graph
- series parallel
- edge detector
- connected subgraphs
- adjacency graph
- hamiltonian cycle
- minimum spanning trees
- knn
- graph structures
- graph representation
- graph model
- graph matching
- connected components
- complex networks