Reconfiguration Graph for Vertex Colourings of Weakly Chordal Graphs.
Carl FeghaliJirí FialaPublished in: CoRR (2019)
Keyphrases
- undirected graph
- labeled graphs
- directed graph
- spanning tree
- graph structure
- random graphs
- edge weights
- attributed graphs
- directed acyclic graph
- maximum cardinality
- vertex set
- adjacency matrix
- approximation algorithms
- average degree
- connected components
- minimum cost
- hamiltonian cycle
- graph structures
- complex networks
- weighted graph
- graph theory
- graph classification
- graph databases
- minimum weight
- bipartite graph
- graph construction
- graph theoretic
- random walk
- graph matching
- connected subgraphs
- graph search
- subgraph isomorphism
- graph properties
- graph data
- graph clustering
- strongly connected
- graph theoretical
- minimum spanning tree
- graph partitioning
- structured data
- graph isomorphism
- graph transformation
- structural pattern recognition
- graph model