List H-Coloring a Graph by Removing Few Vertices.
Rajesh ChitnisLászló EgriDániel MarxPublished in: Algorithmica (2017)
Keyphrases
- weighted graph
- undirected graph
- hamiltonian cycle
- edge weights
- random graphs
- directed edges
- labeled graphs
- adjacency matrix
- directed graph
- minimum weight
- maximum matching
- graph theory
- graph structure
- planar graphs
- random walk
- attributed graphs
- vertex set
- stable set
- graph representation
- maximum cardinality
- bipartite graph
- structured data
- average degree
- ranked list
- maximal cliques
- query graph
- connected subgraphs
- graph based algorithm
- connected components
- spanning tree
- directed acyclic graph
- graph grammars
- graph search
- data sets
- graph matching
- graph mining
- densely connected
- phase transition
- semi supervised