Shedding vertices of vertex decomposable well-covered graphs.
Jonathan BakerKevin N. Vander MeulenAdam Van TuylPublished in: Discret. Math. (2018)
Keyphrases
- labeled graphs
- undirected graph
- attributed graphs
- hamiltonian cycle
- connected subgraphs
- vertex set
- edge weights
- maximum cardinality
- average degree
- weighted graph
- minimum weight
- graph matching
- directed graph
- random graphs
- spanning tree
- bipartite graph
- similarity function
- graph clustering
- adjacency matrix
- graph kernels
- traveling salesman problem
- biological networks
- minimum cost
- graph data
- planar graphs
- betweenness centrality
- directed acyclic graph
- directed edges
- strongly connected
- minimum spanning tree
- graph theoretic
- graph structure
- approximation algorithms
- random walk
- graph structures
- markov networks
- graph databases
- query graph
- phase transition
- connected components
- np complete