List H-Coloring a Graph by Removing Few Vertices.
Rajesh Hemant ChitnisLászló EgriDániel MarxPublished in: ESA (2013)
Keyphrases
- weighted graph
- labeled graphs
- adjacency matrix
- edge weights
- random graphs
- undirected graph
- graph theory
- average degree
- vertex set
- graph representation
- hamiltonian cycle
- attributed graphs
- planar graphs
- random walk
- directed edges
- graph theoretic
- spanning tree
- maximal cliques
- minimum weight
- graph model
- graph search
- graph clustering
- graph structure
- maximum matching
- bipartite graph
- phase transition
- connected components
- stable set
- genetic algorithm
- connected graphs
- maximum cardinality
- shortest path
- social network analysis
- graph matching
- subgraph isomorphism
- graph kernels
- graph databases
- graphical representation